Sciweavers

CORR
2008
Springer

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

13 years 3 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 dramatically improves the standard algorithm based on
Ping Li
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Ping Li
Comments (0)