Author:
Feigenblat Guy,Porat Ely,Shiftan Ariel
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference31 articles.
1. A small approximately min-wise independent family of hash functions;Indyk;Journal of Algorithms,1999
2. Tighter estimation using bottom k sketches;Cohen;PVLDB,2008
3. Summarizing data using bottom-k sketches;Cohen;PODC,2007
4. Size-estimation framework with applications to transitive closure and reachability;Cohen;Journal of Computer and System Sciences,1997
5. M. Datar, S. Muthukrishnan, Estimating rarity and similarity over data stream windows, in: Proceedings of 10th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 2461, 2002, pp. 323–334.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Addendum to ‘Exponential time improvement for min-wise based algorithms’ [Information and Computation 209 (2011) 737–747];Information and Computation;2016-12
2. Weighted Similarity Estimation in Data Streams;Proceedings of the 24th ACM International on Conference on Information and Knowledge Management;2015-10-17
3. STRIP;Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining;2013-08-11