Level up your Beat Saber experience on Quest! AnyTweaks provides various tweaks to help boost your experience on Quest, such as Bloom, FPS Counter and more.

Skip List, Bloom Filter, Ring Buffer, Query Counter, LRU, LFU... 🚀🚀🚀 Data structures and algorithm implementation in golang.

Probabilistic data structures (bloom filter / counting bloom filter / linear counter)

A bloomfilter libary with traditional bloom filter and counter bloom filter's implementation.

Cardinality counter that uses bloom filter internally.

A project made in Java to create a Bloom Filter counting, a Stochastic Counter and a MinHash

Simple kmer counter using Bloom filter and efficient hash function

Implementation of a Stochastic Counter, Counting Bloom Filter and Min Hash technique using Java

Bloom-based counters

No description available

Kmer counter implementing bloom filters with input given size

Example implementation for bloom filter(BF) and counter bloom filter(CBF).

App that counts the blooms with HTML, CSS and JavaScript

A tracker of chlorophyll blooms in Alaskan waters.

An App that counts how much is left until Spring Bloom

No description available

Implementation of hash-tables, counters, bloom-filters and flow-size sketches

Stochastic counter, Bloom Filter and MinHashing to get probability of lottery winners and similarity of prizes

Network data structures such as Bloom filter, Counter sketch, hash tables and virtual bitmaps are implemented using Java

What if we only update the minimum hash among all k options in Count-Min Sketch(This would reduce the number of updates that are applied to the counters) and also compress the number of rows to 1 like bloom filter(this would increase collisions)? who would this trade-off work. To test this out we run several experiments