Sciweavers

47 search results - page 8 / 10
» Sample synopses for approximate answering of group-by querie...
Sort
View
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 18 days 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
14 years 27 days 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
14 years 1 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...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin