Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

90

Voted

TALG
2010

82views more TALG 2010»

A near-optimal algorithm for estimating the entropy of a stream

15 years 1 months ago

A near-optimal algorithm for estimating the entropy of a stream

Download www.cs.dartmouth.edu

Amit Chakrabarti, Graham Cormode, Andrew McGregor

Real-time Traffic

TALG 2010 |

claim paper

Related Content

» NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness

» Estimating Entropy and Entropy Norm on Data Streams

» Sketching and Streaming Entropy via Approximation Theory

» A data streaming algorithm for estimating entropies of od flows

» Data streaming algorithms for estimating entropy of network traffic

» Estimating Entropy over Data Streams

» CRprecis A Deterministic Summary Structure for Update Data Streams

» A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting

» An optimal algorithm for the distinct elements problem

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	TALG
Authors	Amit Chakrabarti, Graham Cormode, Andrew McGregor

Comments (0)