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 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
Sorting:
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆64Updated 9 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- GPU B-Tree with support for versioning (snapshots).☆47Updated 7 months ago
- ☆47Updated 2 years ago
- a dynamic 2d space partitioning tree☆22Updated 4 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆55Updated 2 years ago
- Evaluating different memory managers for dynamic GPU memory☆25Updated 4 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU☆21Updated 9 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- The Hybrid Task Graph Scheduler API☆40Updated last month
- C++ spherical geometry primitives for LSST Data Management☆18Updated last week
- mallocMC: Memory Allocator for Many Core Architectures☆55Updated 3 weeks ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆12Updated 4 years ago
- Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs☆25Updated last year
- Shared Memory, Message Passing, and Hybrid Merge Sort: UPC, OpenMP, MPI and Hybrid Implementations☆14Updated last year
- 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
- A reference implementation of std::simd, providing data parallel types in the C++ standard☆12Updated 5 years ago
- Naive Hilbert R-Tree implementation☆29Updated 10 years ago
- ☆66Updated 2 years ago
- Volume Manipulation Library☆16Updated last year
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 7 years ago
- A library with space-filling curve algorithms (analysis, neighbor-finding, visualization) and other utilities (math, geometry, image proc…☆23Updated 7 years ago
- ☆21Updated 4 years ago
- PH-Tree C++ implementation by Improbable.☆23Updated 2 years ago
- Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries☆71Updated 8 years ago
- Simplified Interface to Complex Memory☆28Updated last year
- C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)☆33Updated 4 years ago
- Giddy - A lightweight GPU decompression library☆42Updated 5 years ago