132 search results - page 3 / 27 » Optimal approximations of the frequency moments of data stre... |
FAW
2008
Springer
13 years 8 months ago
2008
Springer
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
STOC
1996
ACM
13 years 10 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
COCO
2003
Springer
13 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
IM
2006
13 years 6 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...