Sciweavers

132 search results - page 2 / 27
» Optimal approximations of the frequency moments of data stre...
Sort
View
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
13 years 11 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
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 5 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 5 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
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
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
13 years 11 months ago
On Estimating Frequency Moments of Data Streams
Sumit Ganguly, Graham Cormode