40 search results - page 1 / 8 » On Estimating Frequency Moments of Data Streams |
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
FAW
2008
Springer
13 years 6 months ago
2008
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give a space-optimal algorithm with update time O(log2 (1/) log log(1/)) for (1
CORR
2008
Springer
13 years 4 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...