Sciweavers

43 search results - page 1 / 9
» Estimating Frequency Moments of Data Streams Using Random Li...
Sort
View
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
13 years 10 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
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...
Sumit Ganguly
CORR
2011
Springer
158views Education» more  CORR 2011»
12 years 12 months ago
Polynomial Estimators for High Frequency Moments
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...
Sumit Ganguly
FOCS
2008
IEEE
13 years 11 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
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...
Paul Beame, Dang-Trinh Huynh-Ngoc
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 5 months ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
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...
Ping Li
ICALP
2009
Springer
14 years 5 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
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...
Sudipto Guha, Zhiyi Huang