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 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
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 4 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated last month
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆118Updated 5 years ago
• rdspring1 / Count-Sketch-Optimizers
  A compressed adaptive optimizer for training large-scale deep learning models using PyTorch
  ☆27Updated 5 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• optml / CoCoA
  ☆19Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 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
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆45Updated 5 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 7 years ago
• mahito-sugiyama / Legendre-decomposition
  Legendre decomposition for tensors
  ☆13Updated 6 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆57Updated 2 years ago
• djsutherland / igms
  Implicit generative models and related stuff based on the MMD, in PyTorch
  ☆16Updated 4 years ago
• huanzhang12 / hogwildpp
  HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent
  ☆33Updated 8 years ago
• epfml / cola
  CoLa - Decentralized Linear Learning: https://arxiv.org/abs/1808.04883
  ☆20Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• fabianp / ProxASAGA
  Proximal Asynchronous SAGA
  ☆12Updated 7 years ago
• FurongHuang / TensorDecomposition4TopicModeling
  ☆20Updated 7 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• premgopalan / bnprec
  Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…
  ☆15Updated 10 years ago
• Hanjun-Dai / sequence2vec
  ☆8Updated 6 years ago