DIALM   2007 Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications
Wall of Fame | Most Viewed DIALM-2007 Paper
178views Algorithms» more  DIALM 2007»
10 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
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...
Björn Scheuermann, Martin Mauve
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source178
2Download preprint from source144
3Download preprint from source131
4Download preprint from source110
5Download preprint from source92