Reference15 articles.
1. Alon N, Matias Y, Szegedy M (1996) The space complexity of approximating the frequency moments. In: ACM symposium on theory of computing, Philadelphia, pp 20–29
2. Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: Procedings of the international colloquium on automata, languages and programming (ICALP), Málaga
3. Cormode G, Hadjieleftheriou M (2009) Finding the frequent items in streams of data. Commun ACM 52(10):97–105
4. Cormode G, Muthukrishnan S (2005) An improved data stream summary: the Count-Min sketch and its applications. J Algorithms 55(1):58–75
5. Cormode G, Muthukrishnan S (2005) Summarizing and mining skewed data streams. In: SIAM conference on data mining, Newport Beach
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Delegation sketch;Proceedings of the Fifteenth European Conference on Computer Systems;2020-04-15