wangyiqiu / dbscan

Related projects: ⓘ

• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 2 years ago
• wangyiqiu / hdbscan
  A Fast Parallel Algorithm for HDBSCAN* Clustering
  ☆53Updated last year
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆17Updated last year
• wangyiqiu / dbscan-python
  Theoretically Efficient and Practical Parallel DBSCAN
  ☆65Updated last year
• jalvarm / hcnng
  This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs
  ☆12Updated 4 years ago
• HPCGraphAnalysis / PuLP
  ☆22Updated last year
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 5 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆62Updated 2 years ago
• Kejing-Lu / hvs
  ☆14Updated last year
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆18Updated 3 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆141Updated 3 years ago
• vazois / TopK
  TopK Algorithms Benchmark
  ☆9Updated 5 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆24Updated 3 years ago
• rahulyesantharao / batch-dynamic-kdtree
  Parallel, batch-dynamic kdtree
  ☆10Updated 2 years ago
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆55Updated 3 years ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆29Updated 7 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆15Updated 3 years ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆16Updated 6 years ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆26Updated 3 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆30Updated 7 years ago
• 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…
  ☆104Updated 2 weeks ago
• HuangQiang / P2HNNS
  Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
  ☆12Updated 3 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated last year
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆195Updated 9 months ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆26Updated 5 months ago
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆40Updated last year
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆18Updated this week
• HuangQiang / lccs-lsh
  LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)
  ☆13Updated 3 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…
  ☆28Updated 5 years ago