Zobrazeno 1 - 10
of 4 616
pro vyhledávání: '"graph computation"'
Autor:
Ning, Baoling, Li, Jianzhong
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by optimizing the big
Externí odkaz:
http://arxiv.org/abs/2404.05949
The Mixture-of-Expert (MoE) technique plays a crucial role in expanding the size of DNN model parameters. However, it faces the challenge of extended all-to-all communication latency during the training process. Existing methods attempt to mitigate t
Externí odkaz:
http://arxiv.org/abs/2404.19429
Autor:
Heckel, Reiko, Poskitt, Christopher M.
Publikováno v:
EPTCS 374, 2022
This volume contains the post-proceedings of the Thirteenth International Workshop on Graph Computation Models (GCM 2022). The workshop took place in Nantes, France on 6th July 2022 as part of STAF 2022 (Software Technologies: Applications and Founda
Externí odkaz:
http://arxiv.org/abs/2212.10975
Autor:
Courtehoute, Brian, Plump, Detlef
Publikováno v:
EPTCS 374, 2022, pp. 23-44
We present a computation model based on a subclass of GP 2 graph programs which can simulate any off-line Turing machine of space complexity O(s(n) log s(n)) in space O(s(n)). The simulation only requires a quadratic time overhead. Our model shares t
Externí odkaz:
http://arxiv.org/abs/2212.11637
Autor:
Munan Yuan, Xiru Li
Publikováno v:
IET Image Processing, Vol 18, Iss 8, Pp 2161-2178 (2024)
Abstract The registration performance determines the widespread indoor application of 3D models acquired by depth sensors. Many advanced registration methods lack comprehensive feature aggregation and poor generalization capabilities, which improves
Externí odkaz:
https://doaj.org/article/1fb9446b51ea4414a875eec339c51ee1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Fast and reliable K-Nearest Neighbor Graph algorithms are more important than ever due to their widespread use in many data processing techniques. This paper presents a runtime optimized C implementation of the heuristic "NN-Descent" algorithm by Wei
Externí odkaz:
http://arxiv.org/abs/2112.06630
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hoffmann, Berthold, Minas, Mark
Publikováno v:
EPTCS 330, 2020
Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering and beyond, including computer science, biology, business process modelling, etc. Graph c
Externí odkaz:
http://arxiv.org/abs/2012.01181