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

12 years 5 months ago

Download www.stat.cornell.edu

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

Real-time Traffic

CORR 2008 | Data Streams | Education | Relaxed Strict-Turnstile Model | Th Frequency Moments |

claim paper

» Fast NearLossless or Lossless Compression of Large 3D NeuroAnatomical Images

» Comparing Data Streams Using Hamming Norms How to Zero In

» An Efficiency Criterion for 2D Shape Model Selection

» A New Histogrambased Technique for Compressing MultiDimensional Data

» Maintaining Stream Statistics over Sliding Windows

» A Cost Function for Uniformly Partitioned UBTrees

» Design and performance analysis of a DRAMbased statistics counter array architecture

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Ping Li

Comments (0)

Sciweavers

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

CORR 2008 | Data Streams | Education | Relaxed Strict-Turnstile Model | Th Frequency Moments |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers