Large Scale Search Index
☆32May 3, 2023Updated 3 years ago
Alternatives and similar repositories for BLISS
Users that are interested in BLISS are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Everything you always wanted to know about ANNS but were afraid to ask 🥰☆12Dec 21, 2024Updated last year
- ☆16May 6, 2025Updated last year
- ☆17Nov 11, 2025Updated 10 months ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Updated this week
- Code repository for the paper - "AdANNS: A Framework for Adaptive Semantic Search"☆69Oct 10, 2023Updated 2 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- This is a source code for LSH-APG (PVLDB 2023)☆33Aug 21, 2024Updated 2 years ago
- This is the source code of the method proposed in paper: Subspace Collision: An Efficient and Accurate Framework for High-dimensional App…☆30Mar 27, 2026Updated 6 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Linux Foundation Edge - Nexoedge☆14May 30, 2025Updated last year
- An all-in-one framework for Ad-hoc Information Retrieval.☆18Apr 3, 2024Updated 2 years ago
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆18Feb 21, 2024Updated 2 years ago
- [NeurIPS'24] Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid…☆52Sep 15, 2026Updated last week
- ☆15Apr 19, 2026Updated 5 months ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆18Apr 27, 2023Updated 3 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.
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Feb 6, 2020Updated 6 years ago
- This is the source code of the method: DET-LSH (accepted by PVLDB 2024) and PDET-LSH (accepted by TKDE 2026).☆25Jul 29, 2026Updated last month
- Framework for evaluating ANNS algorithms on billion scale datasets.☆450Jul 13, 2026Updated 2 months ago
- FRIF: Fast Robust Invariant Feature☆13Jul 26, 2015Updated 11 years ago
- Historical shortest-path distance querying index by pruned landmark labeling☆10May 24, 2014Updated 12 years ago
- ☆20Jun 23, 2024Updated 2 years ago
- ☆14Jun 11, 2026Updated 3 months ago
- Code for my PhD thesis. Library of quantization-based methods for fast similarity search in high dimensions. Presented at ECCV 18.☆63Aug 23, 2021Updated 5 years ago
- A list of papers in the field of approximate nearest neighbor search on high-dimensional vectors.☆141Aug 11, 2026Updated last month
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Residual Quantization with Implicit Neural Codebooks☆120Jul 17, 2026Updated 2 months ago
- ☆11Nov 23, 2023Updated 2 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Jan 20, 2021Updated 5 years ago
- Implementation of the paper by Google, Transformer Memory As A Differentiable Search Index☆16May 27, 2022Updated 4 years ago
- Scalable DBSCAN and OPTICS for clustering high-dimensional datasets using random projections☆15Nov 1, 2024Updated last year
- Varèse pitch space calculations☆12May 8, 2021Updated 5 years ago
- ☆35Jan 22, 2025Updated last year
- ☆54Sep 12, 2022Updated 4 years ago
- ☆10May 30, 2017Updated 9 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- CUDA templates for tile-sparse matrix multiplication based on CUTLASS.☆52Mar 1, 2018Updated 8 years ago
- System for Grand Prix Metaverse Autonomous Driving Challenge☆19Mar 23, 2026Updated 6 months ago
- CPAM: Compressed Parallel Augmented Maps☆26Aug 18, 2025Updated last year
- 🏆 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
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55May 25, 2015Updated 11 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆62Jul 17, 2020Updated 6 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆65Jan 22, 2025Updated last year