Sciweavers

2735 search results - page 128 / 547
» Comparing notions of randomness
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 10 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ASPDAC
2009
ACM
164views Hardware» more  ASPDAC 2009»
14 years 4 months ago
Accounting for non-linear dependence using function driven component analysis
Majority of practical multivariate statistical analyses and optimizations model interdependence among random variables in terms of the linear correlation among them. Though linear...
Lerong Cheng, Puneet Gupta, Lei He
EDBT
2009
ACM
173views Database» more  EDBT 2009»
14 years 2 months ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
ESORICS
2008
Springer
13 years 11 months ago
On the Impact of User Movement Simulations in the Evaluation of LBS Privacy- Preserving Techniques
The evaluation of privacy-preserving techniques for LBS is often based on simulations of mostly random user movements that only partially capture real deployment scenarios. We clai...
Sergio Mascetti, Dario Freni, Claudio Bettini, Xia...
CSDA
2006
82views more  CSDA 2006»
13 years 10 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin