brc7 / RACEKernelsLinks
RACE sketches for kernel density estimation (KDE)
☆14Updated 5 years ago
Alternatives and similar repositories for RACEKernels
Users that are interested in RACEKernels are comparing it to the libraries listed below
Sorting:
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 5 years ago
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆15Updated 4 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 7 months ago
- ssh code☆12Updated 8 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- FRP: Fast Random Projections☆43Updated 5 years ago
- Fast Fast Hadamard Transform☆85Updated 3 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 7 years ago
- ☆15Updated 7 years ago
- Graph kernels☆55Updated 3 years ago
- The Surprisingly ParalleL spArse Tensor Toolkit.☆73Updated 3 years ago
- Spectral Hashing☆17Updated 10 years ago
- This is outdated -- New version: https://github.com/boyangumn/DCN-New☆94Updated 7 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆16Updated 3 months ago
- FROSTT: the Formidable Repository of Open Sparse Tensors and Tools.☆12Updated 4 months ago
- ☆14Updated 4 years ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆30Updated 6 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆71Updated 6 months ago
- Efficient LSH-based kernel density estimation☆29Updated 6 years ago
- fast library for ANN search and KNN graph construction☆297Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- ☆10Updated 7 years ago
- I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.☆24Updated 4 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆59Updated last year
- ☆25Updated 7 years ago
- Updated version of DCN☆88Updated 3 years ago