rahulyesantharao / batch-dynamic-kdtree

Related projects ⓘ

Alternatives and complementary repositories for batch-dynamic-kdtree

• wangyiqiu / hdbscan
  A Fast Parallel Algorithm for HDBSCAN* Clustering
  ☆54Updated 2 years ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆14Updated 7 months ago
• l3lackcurtains / dbscan-kdtree-cuda
  Massively parallel DBSCAN algorithm implemented in CUDA along with a KD-Tree for searching neighbors.
  ☆9Updated 4 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆18Updated this week
• wangyiqiu / dbscan
  Further development has been moved to a new repository https://github.com/wangyiqiu/dbscan-python
  ☆18Updated last year
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆29Updated 4 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 2 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆89Updated 5 months ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆17Updated 2 years ago
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆61Updated 3 years ago
• jalvarm / hcnng
  This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs
  ☆14Updated 4 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆142Updated 3 years ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 7 years ago
• shamanDevel / cuMat
  An expression template based linear algebra library running completely on the GPU using CUDA
  ☆22Updated 3 years ago
• chengengjie / delaunay-triangulation
  Delaunay Triangulation
  ☆9Updated 5 years ago
• whenever5225 / GraphANNS
  Graph-based Approximate Nearest Neighbor Search Working off CGraph
  ☆31Updated 4 months ago
• jasvob / QRKit
  QRKit is an extension of Eigen C++ library that allows for efficient QR decomposition of sparse matrices with common sparsity patterns.
  ☆16Updated 4 years ago
• intellistream / CANDY-Benchmark
  ☆18Updated this week
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆114Updated this week
• darglein / TinyTorch
  A Minimalistic Auto-Diff Optimization Framework for Teaching and Understanding Pytorch
  ☆16Updated this week
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆25Updated 3 years ago
• wlzhao22 / tsdg
  TSDG: An efficient index graph for graph-based nearest neighbor search
  ☆9Updated 2 years ago
• danini / cvpr2022-affine-tutorial
  The official site of the CVPR 2022 Affine Correspondences and Their Applications tutorial
  ☆11Updated last year
• iromu / Graclus
  Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…
  ☆22Updated 12 years ago
• ParAlg / ParGeo
  ☆42Updated 2 years ago
• cai-lw / parallel-gcn
  Parallel implementation of Graph Convolutional Networks on CPU
  ☆16Updated 5 years ago
• Kejing-Lu / hvs
  ☆14Updated 2 years ago
• taiya / kdtree
  Automatically exported from code.google.com/p/kdtree-matlab
  ☆34Updated 7 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 6 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago