cchatzis / Nearest-Neighbour-LSHLinks
C++ program that, given a vectorised dataset and query set, performs locality sensitive hashing, finding either Nearest Neighbour (NN) or Neighbours in specified range of points in query set, using either Euclidian distance or Cosine Similarity.
☆11Updated 4 years ago
Alternatives and similar repositories for Nearest-Neighbour-LSH
Users that are interested in Nearest-Neighbour-LSH are comparing it to the libraries listed below
Sorting:
- ☆50Updated 3 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- ☆22Updated 4 years ago
- Naive Hilbert R-Tree implementation☆31Updated 11 years ago
- A relatively simple implementation of the R* Tree data structure for C++☆51Updated 3 years ago
- GPU B-Tree with support for versioning (snapshots).☆51Updated last year
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- PH-Tree C++ implementation by Improbable.☆27Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆58Updated 3 years ago
- An efficient C++ multi-threaded sorting function based on C++11 threads☆27Updated 9 years ago
- Templated Portable I/O Environment☆115Updated 9 months ago
- A header-only compile-time Morton encoding / decoding library for N dimensions.☆114Updated 2 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆418Updated 2 months ago
- 稀疏矩阵-向量乘的并行优化算法(OpenMP,AVX)☆11Updated 4 years ago
- A warp-oriented dynamic hash table for GPUs☆76Updated 2 years ago
- a CUDA implementation of a priority queue☆84Updated 5 years ago
- ☆17Updated 10 months ago
- Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries☆71Updated 9 years ago
- A dynamic GPU memory allocator, suitable for warp synchronized scenarios.☆11Updated 6 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆26Updated 8 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆49Updated 6 years ago
- A C++ RangeTree implementation.☆43Updated 5 years ago
- Concurrent CPU-GPU Programming using Task Models☆106Updated 6 years ago
- A polygon to rectangle conversion tool☆19Updated 8 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Graph Coarsening and Partitioning Library☆33Updated 5 years ago
- A generic C++11 k-means clustering implementation☆216Updated 9 months ago
- Parallel Graph Input Output☆18Updated 2 years ago