Picture for Julian Shun

Julian Shun

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering

Add code
Nov 15, 2024
Figure 1 for The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Figure 2 for The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Figure 3 for The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Figure 4 for The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Viaarxiv icon

When Heterophily Meets Heterogeneity: New Graph Benchmarks and Effective Methods

Add code
Jul 15, 2024
Viaarxiv icon

Approximate Nearest Neighbor Search with Window Filters

Add code
Feb 01, 2024
Figure 1 for Approximate Nearest Neighbor Search with Window Filters
Figure 2 for Approximate Nearest Neighbor Search with Window Filters
Figure 3 for Approximate Nearest Neighbor Search with Window Filters
Figure 4 for Approximate Nearest Neighbor Search with Window Filters
Viaarxiv icon

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search

Add code
Dec 13, 2023
Viaarxiv icon

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain

Add code
Jun 08, 2021
Figure 1 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 2 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 3 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 4 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Viaarxiv icon

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

Add code
Apr 02, 2021
Figure 1 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 2 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 3 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 4 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Viaarxiv icon

Theoretically-Efficient and Practical Parallel DBSCAN

Add code
Dec 12, 2019
Figure 1 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 2 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 3 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 4 for Theoretically-Efficient and Practical Parallel DBSCAN
Viaarxiv icon