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 2 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆63Updated 9 years ago
- ☆9Updated 6 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆23Updated 7 years ago
- GPU B-Tree with support for versioning (snapshots).☆46Updated 3 months ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆54Updated 2 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- ☆15Updated 10 years ago
- Graph Coarsening and Partitioning Library☆31Updated 4 years ago
- Evaluating different memory managers for dynamic GPU memory☆24Updated 4 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆33Updated 5 years ago
- Boost.org graph_parallel module☆28Updated last month
- ☆46Updated 2 years ago
- Templated Portable I/O Environment☆113Updated 2 months ago
- The Hybrid Task Graph Scheduler API☆40Updated 3 years ago
- ☆20Updated 3 years ago
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Updated 8 years ago
- A reference implementation of std::simd, providing data parallel types in the C++ standard☆12Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆10Updated 3 years ago
- Compute morton keys using a look-up table generated at compile-time.☆31Updated 8 years ago
- Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU☆21Updated 9 years ago
- Runs a single CUDA/OpenCL kernel, taking its source from a file and arguments from the command-line☆20Updated last week
- 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
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- WIP · CUDA compatibility for Blaze · https://bitbucket.org/blaze-lib/blaze☆17Updated 5 years ago
- ☆28Updated 2 months ago
- Asynchronous Multi-GPU Programming Framework☆45Updated 3 years ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆15Updated last year
- TopK Algorithms Benchmark☆10Updated 5 years ago