We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
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...
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 dramaticall...
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...