89 search results - page 16 / 18 » Approximate lineage for probabilistic databases |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
VLDB
2009
ACM
14 years 7 months ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
PODS
2000
ACM
13 years 11 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
SSDBM
2008
IEEE
14 years 1 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
WACV
2008
IEEE
14 years 1 months ago
2008
IEEE
Most face recognition algorithms use a “distancebased” approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are b...