google / refrLinks
A framework for building reranking models.
☆28Updated 10 years ago
Alternatives and similar repositories for refr
Users that are interested in refr are comparing it to the libraries listed below
Sorting:
- Logistic regression engine for medium-sized data☆55Updated 10 years ago
- Sample implementation of a proposed C++ hashing framework☆29Updated 10 years ago
- ☆154Updated 9 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆78Updated 4 years ago
- A high performance search engine☆107Updated 9 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- Scientific library for high-precision computations and research☆49Updated 8 years ago
- Jubatus algorithm component☆20Updated 6 years ago
- Scalable Distributed LDA implementation for Spark & Glint☆29Updated 9 years ago
- TH++, C++ interface to the torch7 TH library☆246Updated 7 years ago
- Iterator library.☆80Updated 6 years ago
- An efficient character based RNN☆91Updated 6 years ago
- Neural Network engine for Veles distributed machine learning platform☆26Updated 9 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- Open-source implementation of Boostexter (Adaboost based classifier)☆57Updated 7 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 9 years ago
- Intu is a Cognitive Embodiment Middleware for AI on the edge.☆30Updated last year
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆27Updated 7 years ago
- scripts for TAing 15721☆12Updated 10 years ago
- Yahoo!'s topic modelling framework using Latent Dirichlet Allocation☆98Updated 14 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆24Updated 8 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 5 months ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite…☆20Updated 12 years ago
- similarity join and search algorithms for edit distance and jaccard☆19Updated 8 years ago