talwagner / quadsketch

Related projects ⓘ

Alternatives and complementary repositories for quadsketch

• M-Flash / m-flash-cpp
  ☆15Updated 6 years ago
• dhutchis / LaraDB
  A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database
  ☆11Updated 2 years ago
• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆22Updated 5 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆45Updated 10 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 7 years ago
• fabianp / ProxASAGA
  Proximal Asynchronous SAGA
  ☆12Updated 6 years ago
• google / refr
  A framework for building reranking models.
  ☆29Updated 9 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 9 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆30Updated 5 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• vchahun / yart
  Yet another regression toolkit
  ☆12Updated 11 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆46Updated 6 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated 11 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• Hanjun-Dai / sequence2vec
  ☆9Updated 5 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆57Updated last year
• evison / LMF
  Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms
  ☆10Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• zygmuntz / large-scale-linear-learners
  VW, Liblinear and StreamSVM compared on webspam
  ☆14Updated 10 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
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago