1038 search results - page 3 / 208 » Space-Bounded Query Approximation |
TIME
2007
IEEE
14 years 4 months ago
2007
IEEE
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
IJCGA
2002
13 years 9 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...