Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Saleh Ashkboos"'
Autor:
Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tětek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michał Podstawski, Grzegorz Kwaśniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler
Publikováno v:
Besta, M, Miglioli, C, Labini, P S, Tetek, J, Iff, P, Kanakagiri, R, Ashkboos, S, Janda, K, Podstawski, M, Kwasniewski, G, Gleinig, N, Vella, F, Mutlu, O & Hoefler, T 2022, ProbGraph : High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations . in Proceedings of SC 2022 : International Conference for High Performance Computing, Networking, Storage and Analysis . IEEE, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, vol. 2022-November, pp. 1-17, 2022 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2022, Dallas, United States, 13/11/2022 . https://doi.org/10.1109/SC41404.2022.00048
Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enables simple and fast approximate parallel graph mining with strong theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53505069ab1f212588a4bd5c730f6566
Publikováno v:
2021 IEEE International Conference on Big Data (Big Data).
Publikováno v:
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC '21)
SC
SC
Theallreduceoperation is one of the most commonly used communication routines in distributed applications. To improve its bandwidth and to reduce network traffic, this operation can be accelerated by offloading it to network switches, that aggregate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::057985ddabc622c7ad58e91b15494021
https://hdl.handle.net/20.500.11850/518907
https://hdl.handle.net/20.500.11850/518907
Publikováno v:
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
SC
SC
Applying machine learning techniques to the quickly growing data in science and industry requires highly-scalable algorithms. Large datasets are most commonly processed "data parallel" distributed across many nodes. Each node's contribution to the ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::626f561b7cb78facdc28d49f7928f543
http://arxiv.org/abs/1802.08021
http://arxiv.org/abs/1802.08021
Publikováno v:
The Electronic Journal of Combinatorics. 24
In this paper, we investigate the structure of minimum vertex and edge cuts of distance-regular digraphs. We show that each distance-regular digraph $\Gamma$, different from an undirected cycle, is super edge-connected, that is, any minimum edge cut
Autor:
Saleh Ashkboos, Ramin Javadi
Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generalization of this problem seeking for $ k $ disjoint subsets of vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::822f36cd49e13df2b45f5dd3603466b8