Alternatives and similar repositories for quadsketch

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

• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆13Updated 8 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆32Updated 6 years ago
• evison / LMF
  Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms
  ☆10Updated 10 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated 2 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• cloudml / SparkTree
  ☆14Updated 8 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated 2 years ago
• vchahun / yart
  Yet another regression toolkit
  ☆12Updated 11 years ago
• open-machine-learning / mloss
  Machine Learning Open Source Software
  ☆23Updated 6 years ago
• Hanjun-Dai / sequence2vec
  ☆8Updated 6 years ago
• ZhangZhenjie / bed-tree
  A flexible tree-based index structure to support edit distance search on strings
  ☆11Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• abietti / stochs
  stochs: fast stochastic solvers for machine learning in C++ and Cython
  ☆26Updated 2 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• lmcinnes / hypergraph
  A library for hypergraphs and hypergraph algorithms
  ☆28Updated 9 years ago
• djsutherland / cyflann
  A Cython interface to FLANN
  ☆24Updated 4 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• HazyResearch / sampler
  DimmWitted Gibbs Sampler in C++ — ⚠️🚧🛑 REPO MOVED TO DEEPDIVE 👉🏿
  ☆17Updated 8 years ago