59 citations · 99 across the 2 of their papers we have counts for
2 papers
cs.DC2016★ 40 cited
PANDA: Extreme Scale Parallel K-Nearest Neighbor on Distributed Architectures
Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram +8
Computing -Nearest Neighbors (KNN) is one of the core kernels used in many machine learning, data mining and scientific computing applications. Although kd-tree based $O(\log n)…
cs.DS2014★ 59 cited
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide…