Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Gleinig, Niels"'
The synthesis approaches for quantum circuits typically aim at minimizing the number of lines or gates. Given the tight restrictions on those logical resources in physical implementations, we propose to view the problem fundamentally different: Given
Externí odkaz:
http://arxiv.org/abs/2302.01066
As the accuracy of machine learning models increases at a fast rate, so does their demand for energy and compute resources. On a low level, the major part of these resources is consumed by data movement between different memory units. Modern hardware
Externí odkaz:
http://arxiv.org/abs/2301.01048
Autor:
Besta, Maciej, Miglioli, Cesare, Labini, Paolo Sylos, Tětek, Jakub, Iff, Patrick, Kanakagiri, Raghavendra, Ashkboos, Saleh, Janda, Kacper, Podstawski, Michal, Kwasniewski, Grzegorz, Gleinig, Niels, Vella, Flavio, Mutlu, Onur, Hoefler, Torsten
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis, November 2022
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:
http://arxiv.org/abs/2208.11469
Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In this paper,
Externí odkaz:
http://arxiv.org/abs/1801.01357
Publikováno v:
Complexity (2018)
The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, i.e., the ability to make appropriate responses to the attacks. In this article, we investigated the state-of-the-art targeted node at
Externí odkaz:
http://arxiv.org/abs/1710.03522
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2019 Apr 01. 116(14), 6554-6559.
Externí odkaz:
https://www.jstor.org/stable/26698540
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Data movements between different levels of the memory hierarchy (I/O-transitions, or simply I/O s) are a critical performance bottleneck in modern computing. Therefore it is a problem of high practical relevance to find algorithms that use a minimal
Publikováno v:
DAC: Annual ACM/IEEE Design Automation Conference; 2019, Issue 56, p451-456, 6p
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.