Alternatives and similar repositories for quadsketch:

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

• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 8 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• evison / LMF
  Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms
  ☆10Updated 10 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 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
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• dhutchis / LaraDB
  A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database
  ☆11Updated 3 years ago
• open-machine-learning / mloss
  Machine Learning Open Source Software
  ☆23Updated 6 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• ADALabUCSD / MorpheusPy
  Factorized Machine Learning with NumPy
  ☆11Updated 4 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆30Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆20Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• lcchen008 / irreg-simd
  Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"
  ☆11Updated 8 years ago
• cloudml / SparkTree
  ☆14Updated 8 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 7 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago