Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Loading…
Loading…
Loading…
Loading…
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
Jayaram, Rajesh, Mirrokni, Vahab, Narayanan, Shyam, Zhong, Peilin
Published in arXiv.org (01.08.2023)
Get full text
Published in arXiv.org (01.08.2023)
Paper
Loading…
Data on Soft Computing Reported by Researchers at Beijing Information Science and Technology University (Component-based 2-/3-dimensional Nearest Neighbor Search Based On Elias Method To Gpu Parallel 2d/3d Euclidean Minimum Spanning Tree Problem)
Published in Computer Weekly News
(24.03.2021)
Get full text
Newsletter
Loading…
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs
Prokopenko, Andrey, Sao, Piyush, Lebrun-Grandie, Damien
Published in Proceedings of the International Conference on Parallel Processing (01.01.2023)
Get full text
Published in Proceedings of the International Conference on Parallel Processing (01.01.2023)
Conference Proceeding
Loading…
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs
Get full text
Paper
Journal Article
Loading…
Loading…
Massively Parallel Minimum Spanning Tree in General Metric Spaces
Azarmehr, Amir, Behnezhad, Soheil, Jayaram, Rajesh, Łącki, Jakub, Mirrokni, Vahab, Zhong, Peilin
Published in arXiv.org (12.08.2024)
Get full text
Published in arXiv.org (12.08.2024)
Paper
Loading…
Loading…
Massively Parallel Minimum Spanning Tree in General Metric Spaces
Azarmehr, Amir, Behnezhad, Soheil, Jayaram, Rajesh, Łącki, Jakub, Mirrokni, Vahab, Zhong, Peilin
Year of Publication 12.08.2024
Year of Publication 12.08.2024
Get full text
Journal Article
Loading…
Constructing Euclidean minimum spanning trees and all nearest neighbors on reconfigurable meshes
Lai, T.H., Ming-Jye Sheng
Published in IEEE transactions on parallel and distributed systems (01.08.1996)
Published in IEEE transactions on parallel and distributed systems (01.08.1996)
Get full text
Journal Article
Loading…
Towards Instance-Optimal Euclidean Spanners
Le, Hung, Solomon, Shay, Than, Cuong, Toth, Csaba D., Zhang, Tianyi
Published in Proceedings / annual Symposium on Foundations of Computer Science (27.10.2024)
Published in Proceedings / annual Symposium on Foundations of Computer Science (27.10.2024)
Get full text
Conference Proceeding
Loading…
Parallel heuristics for the bounded diameter minimum spanning tree problem
Patvardhan, C., Prakash, V. Prem, Srivastav, A.
Published in 2014 Annual IEEE India Conference (INDICON) (01.12.2014)
Published in 2014 Annual IEEE India Conference (INDICON) (01.12.2014)
Get full text
Conference Proceeding
Loading…
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Alvarez, Victor, Seidel, Raimund
Published in Computational geometry : theory and applications (01.02.2010)
Published in Computational geometry : theory and applications (01.02.2010)
Get full text
Journal Article
Loading…
Distributed minimum dominating set approximations in restricted families of graphs
Lenzen, Christoph, Pignolet, Yvonne-Anne, Wattenhofer, Roger
Published in Distributed computing (01.04.2013)
Published in Distributed computing (01.04.2013)
Get full text
Journal Article