BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
☆17Aug 4, 2023Updated 3 years ago
Alternatives and similar repositories for BC-Tree
Users that are interested in BC-Tree are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 5 years ago
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆14Jul 8, 2021Updated 5 years ago
- Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023) (CPU version)☆12Sep 13, 2023Updated 3 years ago
- Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023)☆11Sep 12, 2023Updated 3 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Jul 9, 2021Updated 5 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆16Jul 9, 2021Updated 5 years ago
- CTBench: Cryptocurrency Time Series Generation Benchmark (ICLR'26)☆12Mar 1, 2026Updated 8 months ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Nov 12, 2020Updated 6 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- Effective Abstract Reasoning with Dual-Contrast Network☆11Jun 25, 2021Updated 5 years ago
- Unsupervised Abstract Reasoning for Raven’s Problem Matrices☆12Sep 22, 2021Updated 5 years ago
- ☆15Nov 10, 2026Updated last week
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆25Jul 8, 2021Updated 5 years ago
- Experiments on Multi-Source Domain Adaptation☆26Jan 4, 2019Updated 7 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Long-Tail Hashing (Learning to hash from more realistic long-tail datasets), SIGIR 2021, CCF A类.☆16Jul 20, 2021Updated 5 years ago
- RACE sketches for kernel density estimation (KDE)☆14Jan 27, 2020Updated 6 years ago
- ☆40Mar 11, 2020Updated 6 years ago
- Explainable Video Action Reasoning via Prior Knowledge and State Transitions☆21Jun 20, 2024Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- Parallel, batch-dynamic kdtree☆13Jan 19, 2022Updated 4 years ago
- 🏆 Winning NeurIPS (NIPS) Competition Track: Big ANN, Practical Vector Search Challenge 2023. (see big-ann-benchmark https://big-ann-benc…☆30Aug 16, 2024Updated 2 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- A locality-sensitive hashing library☆43Feb 21, 2014Updated 12 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- ☆12Dec 17, 2022Updated 3 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Dec 9, 2023Updated 2 years ago
- PointRNN, PointGRU and PointLSTM.☆62Jan 8, 2022Updated 4 years ago
- ☆30Sep 14, 2022Updated 4 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆44Sep 17, 2018Updated 8 years ago
- Secondary index on HBase☆18Oct 24, 2015Updated 11 years ago
- Billion-scale Semantic Search dataset derived from Microsoft SpaceV for Vector Search benchmarks with smaller subsets☆12Aug 27, 2025Updated last year
- A clustering algorithm that will perform clustering on each of a time-series of discrete datasets, and explicitly track the evolution of …☆17Sep 7, 2020Updated 6 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 6 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆52Sep 27, 2013Updated 13 years ago
- ☆16Jan 24, 2025Updated last year
- PH-Tree C++ implementation by Improbable.☆28Mar 7, 2023Updated 3 years ago
- reimplementing scalog from scratch☆31Oct 11, 2020Updated 6 years ago
- Official ICLR 2025 implementation of CQG-MBQA: interpretable semantic text embeddings where every dimension is the answer to an automatic…☆12Sep 6, 2026Updated 2 months ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆72Apr 29, 2025Updated last year
Are these results useful?