28 search results - page 4 / 6 » Fast, small-space algorithms for approximate histogram maint... |
EDBT
2006
ACM
13 years 8 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
ICB
2009
Springer
14 years 1 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
STACS
2007
Springer
14 years 24 days ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...