1091 search results - page 164 / 219 » Approximation in Databases |
215
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
206
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
218
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
155
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
114
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...