• No results found

A first approximation to the data

A First Approximation to the Evolution of Commuting in Catalonia, 1986-1996

A First Approximation to the Evolution of Commuting in Catalonia, 1986-1996

... Number of i → j commuters c ij = ________________________ Total workers living in i as our dependent variable. This variable will take always a value between 0 and 1, as it is the sum of n individual choices made by ...

25

Approximation Algorithms for Wavelet Transform Coding of Data Streams

Approximation Algorithms for Wavelet Transform Coding of Data Streams

... of Data Streams Sudipto Guha and Boulos Harb, Student Member, IEEE Abstract—This paper addresses the problem of finding a B-term wavelet representation of a given discrete function f 2 R n whose distance from f is ...

22

An Example of Peak Finding in Univariate Data by Least Squares Approximation and Restrictions on the Signs of the First Differences

An Example of Peak Finding in Univariate Data by Least Squares Approximation and Restrictions on the Signs of the First Differences

... monotonic approximation method in identifying important extrema in discrete noisy ...monotonic approximation as a data smoothing approach can have many applications, because piecewise monotonicity is ...

6

Continuous Matrix Approximation on Distributed Data

Continuous Matrix Approximation on Distributed Data

... paper, first we pro- pose four novel methods for tracking weighted heavy hitters in a distributed stream of items (note that tracking weighted heavy hitters in the distributed streaming model has not been studied ...

12

Approximation of OLAP queries on data warehouses

Approximation of OLAP queries on data warehouses

... We first introduce three specific methods: the uniform sampling, the measure -based sampling and the statistical ...between data warehouses with edit operations adapted for data ...OLAP data ...

123

Approximation Algorithms for Data Broadcast in Wireless Networks

Approximation Algorithms for Data Broadcast in Wireless Networks

... Let k = k 1 + k 2 . We define a superstep to be a group of consecutive k time slots. In each superstep, the first k 1 slots are for scheduling transmissions from primaries, and the remaining k 2 slots will be for ...

5

Approximation of Lyapunov functions from noisy data

Approximation of Lyapunov functions from noisy data

... the approximation of Lyapunov functions using radial basis ...sampled data which is contaminated with ...we first approximate the underlying vector field, and use this approximation to then ...

25

Rational approximation of discrete data with asymptomatic behaviour

Rational approximation of discrete data with asymptomatic behaviour

... of data that have the same asymptotic limit, but with different rates at which these limits are ...the data in Figure ...polynomial approximation of the first dataset would have a larger value ...

155

Secure approximation of edit distance on genomic data

Secure approximation of edit distance on genomic data

... genomic data owned by a data owner in a time efficient ...genomic data where the data owner cannot see the researcher’s query and the researcher cannot access the genomic data of the ...

13

The Simulation and Approximation of the First Passage Time of the Ornstein--Uhlenbeck Process of Neuron

The Simulation and Approximation of the First Passage Time of the Ornstein--Uhlenbeck Process of Neuron

... 2.5 Distribution Comparison Method The analysis of neural spike trains has a long history [43]. There are two main approaches for such analysis. The first is to formulate a stochastic model for the neuron’s activity and ...

123

Polynomial Approximation of Spectral Data in LVQ and Relevance Learning

Polynomial Approximation of Spectral Data in LVQ and Relevance Learning

... polynomial approximation and relevance learning is able to suppress the influence of ...the first polyno- mial coefficient, which represents T 0 (x) = 1 and can therefore be understood as the constant part ...

9

Saddlepoint approximation for data in simplices: a review with new applications

Saddlepoint approximation for data in simplices: a review with new applications

... saddlepoint approximation is a large deviation technique, with bounded relative error everywhere in the tails, whereas simple Monte Carlo has unbounded relative error in the ...

27

Data Cube Approximation and Mining using Probabilistic Modeling

Data Cube Approximation and Mining using Probabilistic Modeling

... tively data cube, dimension, member, and cube cell in data warehousing ...the data, using a restricted set of parameters, and (ii) providing a faithful description of data, ensuring that the ...

20

Adaptive Least Square Approximation For Fitting Scattered Data

Adaptive Least Square Approximation For Fitting Scattered Data

... square approximation algorithms for fitting scattered data. The first part will present the Knot Insertion and Knot Removal ...each approximation fit with Gaussian basic function with a shape ...

5

Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet

Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet

... Abstract— Data synopsis is a lossy compressed represen- tation of data stored into databases that helps the query optimizer to speed up the query process, ...the data from the database. An efficient ...

13

Regularization and Adaptation for the Approximation of Nonsmooth Solutions for Fredgolm First Kind Integral Equations

Regularization and Adaptation for the Approximation of Nonsmooth Solutions for Fredgolm First Kind Integral Equations

... There are many techniques to treat inverse problems formulated in the form of Fredholm first kind integral equations which must be inverted. Inverse problems typically involve the quantities based on indirect ...

6

Local RBF approximation for scattered data fitting with bivariate splines

Local RBF approximation for scattered data fitting with bivariate splines

... RBF Approximation At the first stage of a two-stage method, the local approximations are needed for each cell T of a partition of Ω associated with the spline method ...the first stage is to find a ...

12

NP-Hard based Data Collection in WSN: A Approximation Algorithm

NP-Hard based Data Collection in WSN: A Approximation Algorithm

... Hence,[8] any n encoded bundles can be downloaded to recuperate the first n information bundles. A few analysts have looked at replication also, deletion codes and have contended that eradication codes can ...

6

Local RBF approximation for scattered data fitting with bivariate splines

Local RBF approximation for scattered data fitting with bivariate splines

... RBF Approximation At the first stage of a two-stage method, the local approximations are needed for each cell T of a partition of Ω associated with the spline method ...the first stage is to find a ...

14

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers

... The first is to mirror (replicate) popular Web sites in dif- ferent locations throughout the world. The original Web site’s homepage would contain a list of mirror sites. This allows users to choose a site based ...

8

Show all 10000 documents...

Related subjects