Sciweavers

244 search results - page 19 / 49
» Efficient Approximation Algorithms for Repairing Inconsisten...
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 8 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
GIS
2006
ACM
14 years 9 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 8 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CSDA
2006
82views more  CSDA 2006»
13 years 8 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