Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kacper Janda"'
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
Autor:
Marcin Copik, Jakub Golinowski, Maciej Besta, Jakub Beránek, Zur Vonarburg-Shmaria, Konstantinos Kanellopoulos, Juan Gómez Luna, Rachata Ausavarungnirun, Torsten Hoefler, Grzegorz Kwasniewski, Kacper Janda, Lukas Gianinazzi, Onur Mutlu, Ioana Stefan, Salvatore Di Girolamo, Raghavendra Kanakagiri, Marek Konieczny, Lukas Kapp-Schwoerer, Nils Blach
Publikováno v:
MICRO
Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators. Yet, there also exist much more complex graph mining algorithms for problems such as clustering or maximal clique listing. These algorithms are memory-bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97f7183904bd367a98e016a1ca8b2243
https://doi.org/10.1145/3466752.3480133
https://doi.org/10.1145/3466752.3480133
Autor:
Lukas Gianinazzi, Kacper Janda, Maciej Besta, Zur Vonarburg-Shmaria, Torsten Hoefler, Armon Carigiet
Publikováno v:
SC20: International Conference for High Performance Computing, Networking, Storage and Analysis
SC
SC
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on work and depth and coloring quality. The key idea is to design a relaxation of the vertex degeneracy order, a well-known graph theory concept, and to color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aae8fbf9a0d154f7171919c3bef18618
Autor:
BESTA, MACIEJ1 maciej.besta@inf.ethz.ch, GERSTENBERGER, ROBERT1 robert@gmail.com, PETER, EMANUEL1 peterem@student.ethz.ch, FISCHER, MARC2 marc.fischer@prodyna.com, PODSTAWSKI, MICHAŁ3 mpodstawski@gmail.com, BARTHELS, CLAUDE1 claudeb@inf.ethz.ch, ALONSO, GUSTAVO1 alonso@inf.ethz.ch, HOEFLER, TORSTEN1 torsten.hoefler@inf.ethz.ch
Publikováno v:
ACM Computing Surveys. Feb2024, Vol. 56 Issue 2, p1-40. 40p.