Alternatives and similar repositories for Nearest-Neighbour-LSH

Users that are interested in Nearest-Neighbour-LSH are comparing it to the libraries listed below

• ParAlg / ParGeo
  ☆51Updated 3 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆31Updated 11 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆51Updated last year
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 3 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• Lucaweihs / range-tree
  A C++ RangeTree implementation.
  ☆43Updated 5 years ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆114Updated 2 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆422Updated 2 months ago
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆27Updated 2 years ago
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆24Updated 4 years ago
• omarobeya / parallel-inplace-radixsort
  ☆23Updated 4 years ago
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆36Updated 5 years ago
• marvinwilliams / multiqueue
  ☆17Updated 10 months ago
• crosetto / cupq
  a CUDA implementation of a priority queue
  ☆84Updated 5 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆53Updated last month
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆14Updated 4 years ago
• pdziepak / ranges-gpu
  Experimental ranges for CUDA
  ☆25Updated 7 years ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆15Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆118Updated last year
• nitnelave / lru_cache
  A C++ implementation of a LRU cache
  ☆42Updated 5 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆30Updated 6 years ago
• zhuqiweigit / DyCuckoo
  ☆13Updated 5 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆216Updated 9 months ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆58Updated 3 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 8 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆115Updated 9 months ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆26Updated 8 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆37Updated this week