1091 search results - page 84 / 219 » Approximation in Databases |
201
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
224
click to vote
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
343
click to vote
ICDE
1996
IEEE
16 years 8 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
163
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
320
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...