HuangQiang / P2HNNSLinks
Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
☆14Updated 3 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 6 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- ☆13Updated last year
- 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
- The source code for PM-LSH (PVLDB 2020)☆11Updated 8 months ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆34Updated 5 months ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆96Updated 5 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆57Updated 6 months ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆34Updated last month
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆25Updated 4 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆26Updated this week
- This is a source code for LSH-APG (PVLDB 2023)☆30Updated 11 months ago
- Algorithms for approximate nearest neighbor search with window filters☆40Updated last year
- Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023) (CPU version)☆13Updated last year
- Two-stage routing with Optimized Guided search and Greedy algorithm☆10Updated last year
- Search with a hash index☆33Updated 6 years ago
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆22Updated last year
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- ☆26Updated 6 months ago
- BurstSketch2020☆8Updated 3 years ago
- Learning-based Approximate k-NN Search in Graph Databases☆11Updated 3 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆391Updated 2 months ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆155Updated this week