2 search results - page 1 / 1 » Near-Optimal Compression of Probabilistic Counting Sketches ... |
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...
PODS
2005
ACM
14 years 4 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...