Alternatives and similar repositories for rehashing:

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

• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆117Updated 4 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 4 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆11Updated 8 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
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• rdspring1 / Count-Sketch-Optimizers
  A compressed adaptive optimizer for training large-scale deep learning models using PyTorch
  ☆27Updated 5 years ago
• fdbresearch / LMFAO
  Layered Multiple Functional Aggregate Optimization
  ☆18Updated 4 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 6 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• optml / CoCoA
  ☆19Updated 6 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆99Updated 6 years ago
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆56Updated last year
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆57Updated 2 years ago
• amplab / cyclades
  Cyclades
  ☆28Updated 6 years ago
• snap-stanford / snap-dev
  SNAP repository for Ringo
  ☆14Updated 7 years ago
• mahito-sugiyama / Legendre-decomposition
  Legendre decomposition for tensors
  ☆13Updated 6 years ago
• wouterkool / ancestral-gumbel-top-k-sampling
  Ancestral Gumbel-Top-k Sampling
  ☆23Updated 4 years ago
• eelenberg / streak
  Interpreting neural networks via the STREAK algorithm (streaming weak submodular maximization)
  ☆22Updated 7 years ago