2 search results - page 1 / 1 » Near-Optimal Compression of Probabilistic Counting Sketches ... |
143
Voted
DIALM
2007
ACM
15 years 4 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...
141
Voted
PODS
2005
ACM
16 years 11 days 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...