132 search results - page 1 / 27 » Optimal approximations of the frequency moments of data stre... |
74
Voted
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give a space-optimal algorithm with update time O(log2 (1/) log log(1/)) for (1
CORR
2008
Springer
14 years 10 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...