cchatzis / Nearest-Neighbour-LSH
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 3 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
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆64Updated 9 years ago
- ☆21Updated 4 years ago
- ☆47Updated 2 years ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- GPU B-Tree with support for versioning (snapshots).☆47Updated 5 months ago
- ☆9Updated 6 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆55Updated 2 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆34Updated 5 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆23Updated 7 years ago
- A polygon to rectangle conversion tool☆17Updated 7 years ago
- Shared Memory, Message Passing, and Hybrid Merge Sort: UPC, OpenMP, MPI and Hybrid Implementations☆14Updated last year
- Evaluating different memory managers for dynamic GPU memory☆25Updated 4 years ago
- A GPU-based LZSS compression algorithm, highly tuned for NVIDIA GPGPUs and for streaming data, leveraging the respective strengths of CPU…☆35Updated 9 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- PH-Tree C++ implementation by Improbable.☆22Updated 2 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆11Updated 3 years ago
- a dynamic 2d space partitioning tree☆22Updated 3 years ago
- ☆17Updated 2 weeks ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Sparse-dense matrix-matrix multiplication on GPUs☆14Updated 6 years ago
- Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU☆21Updated 9 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆28Updated 6 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- ☆25Updated 4 years ago
- Templated Portable I/O Environment☆113Updated 4 months ago
- c++ posit implementation☆44Updated last year
- Naive Hilbert R-Tree implementation☆29Updated 10 years ago
- A library with space-filling curve algorithms (analysis, neighbor-finding, visualization) and other utilities (math, geometry, image proc…☆24Updated 7 years ago