rossanoventurini / Variable-BMWLinks
☆13Updated 8 years ago
Alternatives and similar repositories for Variable-BMW
Users that are interested in Variable-BMW are comparing it to the libraries listed below
Sorting:
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆100Updated 2 months ago
- Common Index File Format to to support interoperability between open-source IR engines☆40Updated last year
- A Python interface to PISA☆37Updated 3 months ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆66Updated 2 months ago
- SUccinct Retrieval Framework☆21Updated 9 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆39Updated 5 months ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 3 months ago
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆32Updated 3 weeks ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Updated 6 years ago
- Graph Library for Approximate Similarity Search☆136Updated 3 months ago
- A list of multi-vector retrieval resources☆16Updated last year
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆172Updated 4 years ago
- ☆198Updated this week
- ⚡ Faster similarity search with PDX: A vertical data layout for vectors☆63Updated 4 months ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆219Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 9 months ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆59Updated 5 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".☆52Updated 9 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- Distributed similarity search☆10Updated 5 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆174Updated last week
- Framework for evaluating ANNS algorithms on billion scale datasets.☆414Updated last week
- similarity join and search algorithms for edit distance and jaccard☆19Updated 8 years ago
- Efficient and effective query auto-completion in C++.☆57Updated 2 years ago
- Tools relating to the CC-News-En Collection☆20Updated 2 years ago