A versatile bitmap font with an organic flair.
Bloom filter with 128-bit MurmurHash3 optimization using Kirsch-Mitzenmacher technique
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Allan Bloom & Adam Kirsch The Republic of Plato is available now
a fast javascript counting bloom filter implementation
Bloom Filter using the FNV hash function
beautifully read the beautiful poem 'Roll the dice' - by Charles Bukowski
The RAW BloomFilter library, a fast, memory-efficient bloom filter implementation for membership checks.
a fast javascript counting bloom filter implementation
A bloom filter using FX Hash with Kirsch and Mitzenmacher optimization.
This package provides tools for image processing with a focus on edge detection and morphological transformations
submillisecond.com cookbook recipe - data-structures: subms-count-min-sketch. Frequency-estimation sketch with conservative update and Kirsch-Mitzenmacher hashing.
Streaming anomaly detection toolkit — Random Cut Forest, per-feature drift, streaming sketches, SOC triage, hot-path ingress. Facade re-export of anomstream-core / anomstream-triage / anomstream-hotpath.
Core streaming anomaly detectors + companion primitives (Random Cut Forest, per-feature EWMA / CUSUM, drift detectors, streaming stats) — part of the anomstream toolkit
High-cadence ingress primitives (UpdateSampler, PrefixRateCap, bounded MPSC channel) for eBPF-style classifier/updater thread splits on top of anomstream-core
SOC-opinionated triage layer (Platt calibration, SAGE attribution, alert clustering, feedback, audit) on top of anomstream-core
B-field datastructure implementation in Rust
bloom filter is a probabilistic filter which SPV clients provide so we can filter the transactions we send them -- this allows for significantly more efficient transaction and block downloads
LevelDB-compatible Bloom filter policy and test harness for the bitcoin-rs LevelDB port, implementing Kirsch–Mitzenmacher double hashing over byte slices.
A space and time efficient Bloom Filter implementation in Rust.
A simple Bloom filter using only two hash functions
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.