HuangQiang / P2HNNSLinks
Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
☆14Updated 4 years ago
Alternatives and similar repositories for P2HNNS
Users that are interested in P2HNNS are comparing it to the libraries listed below
Sorting:
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆29Updated 4 years ago
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆17Updated 4 years ago
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆15Updated 4 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆209Updated 4 years ago
- PQ Fast Scan☆65Updated 6 years ago
- ☆12Updated last year
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆19Updated 2 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆70Updated 5 months ago
- Algorithms for approximate nearest neighbor search with window filters☆42Updated last year
- The source code for PM-LSH (PVLDB 2020)☆12Updated 10 months ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- Two-stage routing with Optimized Guided search and Greedy algorithm☆10Updated 2 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆61Updated 8 months ago
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆26Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆36Updated 7 months ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆27Updated last month
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆20Updated 5 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆97Updated last month
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆76Updated 4 years ago
- Search with a hash index☆33Updated 6 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆24Updated 11 months ago
- This is a source code for LSH-APG (PVLDB 2023)☆31Updated last year
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆22Updated last year
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago
- A Recursive Spatial Model Index☆38Updated last year