A faster Count-Min Sketch implementation for estimating item frequencies in a stream.
JavaScript
4
0
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of jdvorak/count-min-sketch
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Count-Min Sketch Data Structure
Top contributors
JDvorak
2 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet