Probabilistic lossy counting: an efficient algorithm for finding heavy hitters

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Xenofontas Dimitropoulos IBM Zurich Research Laboratory
Paul Hurley IBM Zurich Research Laboratory
Andreas Kind IBM Zurich Research Laboratory
Published in:
Cover Image
 
· Newsletter
ACM SIGCOMM Computer Communication Review archive
Volume 38 Issue 1, January 2008
Pages 5-5
ACM New York, NY, USA
table of contents doi>10.1145/1341431.1341433
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 34
· Downloads (cumulative): 389
· Citation Count: 7


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder