9 search results - page 1 / 2 » A Very Efficient Scheme for Estimating Entropy of Data Strea... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
DIALM
2007
ACM
13 years 8 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
CVPR
2006
IEEE
13 years 8 months ago
2006
IEEE
We propose efficiency of representation as a criterion for evaluating shape models, then apply this criterion to compare the boundary curve representation with the medial axis. We...