13 search results - page 2 / 3 » A near-optimal algorithm for estimating the entropy of a str... |
TALG
2010
13 years 3 months ago
2010
ESA
2006
Springer
13 years 9 months ago
2006
Springer
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...