13 search results - page 1 / 3 » A near-optimal algorithm for estimating the entropy of a str... |
COCO
2003
Springer
13 years 10 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 5 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...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
IMC
2007
ACM
13 years 6 months ago
2007
ACM
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
SIGMETRICS
2006
ACM
13 years 11 months ago
2006
ACM
