105 citations · 151 across the 14 of their papers we have counts for
Showing 2009 · cs.DSShow all
3 papers · 2 filters
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.,…
cs.DS2009★ 1 cited
Estimating Entropy of Data Streams Using Compressed Counting
Ping Li
The Shannon entropy is a widely used summary statistic, for example, network traffic measurement, anomaly detection, neural computations, spike trains, etc. This study focuses on e…
cs.DS2009★ 1 cited
On the Sample Complexity of Compressed Counting
Ping Li
Compressed Counting (CC), based on maximally skewed stable random projections, was recently proposed for estimating the p-th frequency moments of data streams. The case p->1 is ext…