ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2312.03940
  4. Cited By
PECANN: Parallel Efficient Clustering with Graph-Based Approximate
  Nearest Neighbor Search

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

6 December 2023
Shangdi Yu
Joshua Engels
Yihao Huang
Julian Shun
ArXivPDFHTML

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

2 / 2 papers shown
Title
A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near
  Neighbor Graph
A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph
Anshumali Shrivastava
Zhao Song
Zhaozhuo Xu
GNN
39
8
0
10 Mar 2023
Concurrent Disjoint Set Union
Concurrent Disjoint Set Union
S. Jayanti
R. Tarjan
FedML
27
13
0
02 Mar 2020
1