5 citations · 9 across the 3 of their papers we have counts for
3 papers
stat.ML2011★ 5 cited
Accurate Estimators for Improving Minwise Hashing and b-Bit Minwise Hashing
Ping Li, Christian Konig
Minwise hashing is the standard technique in the context of search and databases for efficiently estimating set (e.g., high-dimensional 0/1 vector) similarities. Recently, b-bit mi…
cs.DB2011
Fast Set Intersection in Memory
Bolin Ding, Arnd Christian König
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their inte…
cs.DS2009★ 4 cited
b-Bit Minwise Hashing
Ping Li, Arnd Christian Konig
This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g.,…