Author:
Bu Tian,Cao Jin,Chen Aiyou,Lee Patrick P.C.
Subject
Computer Networks and Communications
Reference18 articles.
1. Space/time trade-offs in hashing coding with allowable errors;Bloom;Communications of the ACM,1970
2. Network applications of bloom filters: a survey;Broder;Internet Mathematics,2003
3. T. Bu, J. Cao, A. Chen, P.P.C. Lee, A fast and compact method for unveiling significant patterns in high speed networks, in: Proceedings of IEEE INFOCOM, 2007.
4. G. Cormode, F. Korn, S. Muthukrishnan, D. Srivastava, Finding hierarchical heavy hitters in data streams, in: VLDB, 2003.
5. Probabilistic lossy counting: an efficient algorithm for finding heavy hitters;Dimitropoulos;ACM SIGCOMM Computer Communication Review,2008
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献