Alternatives and similar repositories for Nearest-Neighbour-LSH:

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

• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆11Updated 4 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 2 years ago
• apc-llc / whippletree
  Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU
  ☆21Updated 9 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 6 months ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆25Updated 4 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆32Updated 5 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆33Updated 4 years ago
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆22Updated 3 years ago
• CGCL-codes / Frog
  Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…
  ☆36Updated 3 years ago
• baserinia / parallel-sort
  An efficient C++ multi-threaded sorting function based on C++11 threads
  ☆27Updated 8 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆70Updated 8 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆25Updated last year
• sebastianlipponer / zorder_knn
  Floating point morton order comparison operator.
  ☆15Updated 11 months ago
• horizon-research / rtnn
  ☆64Updated last year
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 2 years ago
• Ten0 / updatable_priority_queue
  High-performance updatable priority queue in C++
  ☆39Updated 3 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• shininglion / rectirization
  A polygon to rectangle conversion tool
  ☆17Updated 7 years ago
• weifengliu-ssslab / Benchmark_SpTRSV_using_CSC
  A Synchronization-Free Algorithm for Parallel Sparse Triangular Solves (SpTRSV)
  ☆21Updated 5 years ago