Alternatives and similar repositories for minhashcuda

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

• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆93Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 2 months ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆209Updated 5 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆147Updated 9 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• amplab / cyclades
  Cyclades
  ☆28Updated 7 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆60Updated 6 years ago
• cuMF / cumf_als
  CUDA Matrix Factorization Library with Alternating Least Square (ALS)
  ☆179Updated 6 years ago
• ryanrhymes / panns
  Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
  ☆214Updated 3 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆207Updated 3 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 6 years ago
• rdspring1 / LSH_DeepLearning
  Scalable and Sustainable Deep Learning via Randomized Hashing
  ☆93Updated 3 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• rapidsai / libgdf
  [ARCHIVED] C GPU DataFrame Library
  ☆138Updated 6 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆386Updated last year
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• YahooArchive / Optimal-LSH
  This package provides an efficient implementation of locality-sensitve hashing (LSH)
  ☆153Updated 13 years ago
• simonemainardi / LSHash
  A fast Python implementation of locality sensitive hashing.
  ☆70Updated 10 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• piskvorky / sim-shootout
  Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…
  ☆99Updated 9 years ago
• lyst / rpforest
  It is a forest of random projection trees
  ☆224Updated 5 years ago
• IntelLabs / pWord2Vec
  Parallelizing word2vec in shared and distributed memory
  ☆190Updated 2 years ago
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆74Updated 3 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆263Updated 3 months ago
• maumueller / ann-benchmarks
  Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
  ☆27Updated 7 years ago