48 search results - page 2 / 10 » Fast Moment Estimation in Data Streams in Optimal Space |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
IM
2006
13 years 8 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
PODS
2005
ACM
14 years 8 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...