9 results found Sort:
- Filter by Primary Language:
- Python (3)
- C# (2)
- C++ (1)
- Clojure (1)
- Go (1)
- TypeScript (1)
- +
Probabilistic data structures for processing continuous, unbounded streams.
Created
2015-02-06
152 commits to master branch, last one 3 years ago
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Created
2012-05-15
6,672 commits to master branch, last one 5 years ago
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Created
2017-01-23
228 commits to master branch, last one 3 months ago
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Created
2016-11-21
1,275 commits to main branch, last one 7 months ago
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Created
2013-06-15
31 commits to master branch, last one about a year ago
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
Created
2017-07-08
149 commits to master branch, last one 2 months ago
A probabilistic data structures library for C#
Created
2015-12-14
88 commits to master branch, last one 6 years ago
A class library implementing probabilistic data structures in .NET
Created
2016-12-20
99 commits to master branch, last one 5 years ago
Pond is a high performance object-pooling library for Python
Created
2022-08-07
28 commits to master branch, last one 11 months ago