src-d / minhashcuda
Weighted MinHash implementation on CUDA (multi-gpu).
☆114Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for minhashcuda
- A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.☆144Updated 2 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 6 months ago
- LSH-GPU ANN package☆92Updated 5 years ago
- Scalable and Sustainable Deep Learning via Randomized Hashing☆91Updated 2 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- An implementation of locality sensitive hashing with Hadoop☆57Updated 9 years ago
- [ARCHIVED] C GPU DataFrame Library☆138Updated 6 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 9 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆75Updated 2 years ago
- Implementation of fast exact k-means algorithms☆46Updated 5 years ago
- A locality-sensitive hashing library☆45Updated 10 years ago
- This package provides an efficient implementation of locality-sensitve hashing (LSH)☆153Updated 12 years ago
- Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.☆215Updated 3 years ago
- Parallelizing word2vec in shared and distributed memory☆190Updated last year
- Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.☆27Updated 6 years ago
- A library of inverted index data structures☆147Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 9 years ago
- ☆26Updated 7 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆201Updated 4 years ago
- Roaring Bitmap in Cython☆79Updated 6 months ago
- Python bindings for the fast integer compression library FastPFor.☆57Updated last year
- cuda implementation of CBOW model (word2vec)☆115Updated 10 years ago
- ☆16Updated 8 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆60Updated 5 years ago
- Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neig…☆100Updated 9 years ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆90Updated 4 years ago
- Fast and memory-efficient svmlight / libsvm file loader for Python.☆116Updated 5 years ago
- ☆161Updated 8 years ago
- Cyclades☆28Updated 6 years ago
- ☆76Updated 8 years ago