Alternatives and similar repositories for rehashing:

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

• 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
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆118Updated 4 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 4 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• optml / CoCoA
  ☆19Updated 7 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆22Updated last year
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆11Updated 9 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆99Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆54Updated 2 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆46Updated 5 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆27Updated 5 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• ARCambridge / MXNet_linalg_examples
  Examples of building probabilistic models with MXNet linear algebra operators
  ☆23Updated 7 years ago
• yuj-umd / fastsc
  A fast implementation of spectral clustering on GPU-CPU Platform
  ☆31Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 8 months ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 5 years ago
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• montefiore-institute / gradient-energy-matching
  Manuscript and code for the paper "Gradient Energy Matching for Distributed Asynchronous Gradient Descent".
  ☆19Updated 6 years ago
• brc7 / RACEKernels
  RACE sketches for kernel density estimation (KDE)
  ☆13Updated 5 years ago