Alternatives and similar repositories for hashingSearch

Users that are interested in hashingSearch are comparing it to the libraries listed below

• hellozting / CompositeQuantization
  ☆31Updated 7 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆51Updated 12 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆209Updated 4 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆83Updated 11 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆59Updated last year
• czxxjtu / Hash-Learning.github.io
  ☆108Updated 9 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆100Updated 2 months ago
• bd622 / DiscretHashing
  ☆54Updated 7 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆30Updated 6 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆297Updated 7 years ago
• arbabenko / Quantizations
  Source code for learning and evaluation different quantzation methods
  ☆26Updated 10 years ago
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆74Updated 7 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆66Updated 6 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• felixyu / cbe
  Circulant Binary Embedding
  ☆16Updated 11 years ago
• arbabenko / GNOIMI
  ☆160Updated 9 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆35Updated 6 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• caoyue10 / DeepHash-Papers
  Must-read papers on deep learning to hash (DeepHash)
  ☆323Updated 6 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆216Updated 5 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆61Updated 6 years ago
• caoyue10 / cvpr17-dvsq
  The implementation of CVPR-17 paper "Deep Visual-Semantic Quantization of Efficient Image Retrieval"
  ☆68Updated 8 years ago
• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 4 years ago
• RSIA-LIESMARS-WHU / LSHBOX
  A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support python and matlab.
  ☆290Updated 8 years ago
• arbabenko / Spoc
  ☆48Updated 9 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• jiangqy / DDSH-TIP2018
  source code for paper "Deep Discrete Supervised Hashing"
  ☆15Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago