Sciweavers

40 search results - page 6 / 8
» ICICLES: Self-Tuning Samples for Approximate Query Answering
Sort
View
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 6 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 7 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
PODS
2010
ACM
232views Database» more  PODS 2010»
13 years 11 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
IPSN
2004
Springer
13 years 11 months ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas
MICAI
2005
Springer
13 years 11 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...