Alternatives and similar repositories for Flash

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

• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆294Updated 7 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆35Updated 5 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆213Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• IntelLabs / pWord2Vec
  Parallelizing word2vec in shared and distributed memory
  ☆190Updated 2 years ago
• cuMF / cumf_als
  CUDA Matrix Factorization Library with Alternating Least Square (ALS)
  ☆180Updated 7 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆209Updated 4 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆263Updated 3 weeks 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
• rdspring1 / LSH_DeepLearning
  Scalable and Sustainable Deep Learning via Randomized Hashing
  ☆94Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 5 months ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• maumueller / ann-benchmarks
  Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
  ☆28Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆119Updated last year
• dmlc / experimental-mf
  cache-friendly multithread matrix factorization
  ☆89Updated 9 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆65Updated 6 years ago
• cuMF / cumf_sgd
  CUDA Matrix Factorization Library with Stochastic Gradient Descent (SGD)
  ☆72Updated 7 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆84Updated 11 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆45Updated 5 years ago
• hpclab / quickrank
  Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.
  ☆131Updated 6 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆163Updated 6 months ago
• rjagerman / glintlda
  Scalable Distributed LDA implementation for Spark & Glint
  ☆29Updated 8 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆96Updated 5 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated 11 months ago