matsui528 / nanopq

Related projects ⓘ

Alternatives and complementary repositories for nanopq

• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆201Updated 4 years ago
• ZJULearning / nsg
  Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
  ☆632Updated 11 months ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆155Updated 11 months ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆142Updated 3 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆111Updated 11 months ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆61Updated 6 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆92Updated 4 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆284Updated 6 years ago
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆256Updated last year
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆203Updated 3 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• yahoo / lopq
  Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Pyth…
  ☆563Updated 5 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆65Updated 2 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆352Updated last week
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆383Updated 6 months ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆140Updated 3 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆318Updated 3 years ago
• matsui528 / faiss_tips
  Some useful tips for faiss
  ☆592Updated last year
• FALCONN-LIB / FALCONN
  FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
  ☆1,137Updated 5 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆89Updated 5 months ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆34Updated 4 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆58Updated 5 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆62Updated 5 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆71Updated 3 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆57Updated 3 months ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆19Updated 4 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆44Updated 4 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆60Updated 5 years ago