HyperLogLogLog: Counting Distinct Elements With One Log More
☆19May 20, 2022Updated 3 years ago
Alternatives and similar repositories for hyperlogloglog
Users that are interested in hyperlogloglog are comparing it to the libraries listed below
Sorting:
- HyperTwoBits implementation☆17Aug 29, 2025Updated 6 months ago
- Reducing Dimensionality method for Nearest Neighbor Search☆15Nov 12, 2020Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 3 months ago
- HyperLogLog implementations.☆28Aug 11, 2024Updated last year
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆17Oct 15, 2024Updated last year
- Repository for Deep Learning Models for Mass Spectrometry written in Rust☆16Feb 22, 2026Updated 3 weeks ago
- LMS algorithm for computing edit distance with SIMD optimizations☆11Mar 25, 2024Updated last year
- ☆18Dec 26, 2025Updated 2 months ago
- A collection of ML notes☆19Sep 21, 2021Updated 4 years ago
- Count how many bits are set (population count) in C++ using POPCNT via inline assembly and gcc intrinsics (with benchmarks)☆16May 9, 2011Updated 14 years ago
- SD-based Anifusion☆15Dec 23, 2022Updated 3 years ago
- Scalable DBSCAN and OPTICS for clustering high-dimensional datasets using random projections☆13Nov 1, 2024Updated last year
- Tracking Responses to the "Reproducibility in Computer Science" Repository (http://reproducibility.cs.arizona.edu/)☆60Oct 2, 2014Updated 11 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Mar 13, 2025Updated last year
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 4 years ago
- C++ implementations of Powersort and 4-way Powersort☆26Jan 7, 2025Updated last year
- ☆20May 6, 2019Updated 6 years ago
- A Rust implementation of HyperLogLog trying to be parsimonious with memory.☆33Sep 24, 2024Updated last year
- Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest…☆13Aug 5, 2024Updated last year
- WASM bindings for DataFusion☆32Apr 30, 2025Updated 10 months ago
- Automated detection of gaps in bicycle networks: source code for IPDC procedure☆14Jul 12, 2022Updated 3 years ago
- The source code for PM-LSH (PVLDB 2020)☆13Nov 30, 2024Updated last year
- Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…☆36Mar 4, 2026Updated 2 weeks ago
- Example to read qr code with kotlin☆10Jul 24, 2018Updated 7 years ago
- Einsum Expressions in Julia☆14Aug 2, 2025Updated 7 months ago
- Speedy Java execution toolkit.☆22Mar 6, 2023Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 4 years ago
- A HyperLogLog implementation in Rust.☆52Feb 9, 2026Updated last month
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Jul 6, 2021Updated 4 years ago
- LBFGS optimization algorithm ported from liblbfgs☆12Nov 25, 2022Updated 3 years ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆18Apr 27, 2023Updated 2 years ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆40Updated this week
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆13Nov 20, 2022Updated 3 years ago
- Source code for the Joint Shapley values: a measure of joint feature importance☆12Sep 14, 2021Updated 4 years ago
- A Tox plugin using asdf to find python executables.☆16Mar 2, 2026Updated 2 weeks ago
- AnyBlox runtime and tooling☆36Sep 4, 2025Updated 6 months ago
- Simplifying Experimental Algorithmics☆18May 6, 2025Updated 10 months ago