Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Fagginger Auer, B.O."'
Publikováno v:
In Parallel Computing August 2013 39(8):319-335
Autor:
Fagginger Auer, B.O., Bisseling, R.H., Bader, David A., Meyerhenke, Henning, Sanders, Peter, Wagner, Dorothea, Analysis, Sub Analysis begr. 01-01-2014
Publikováno v:
Graph Partitioning and Graph Clustering
Graph Partitioning and Graph Clustering, 588, 223. American Mathematical Society
Graph Partitioning and Graph Clustering, 588, 223. American Mathematical Society
Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we intro
We consider sequential algorithms for hypergraph partitioning and GPU (i.e., fine-grained shared-memory parallel) algorithms for graph partitioning and clustering. Our investigation into sequential hypergraph partitioning is concerned with the effici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::ba87bad60cf4a3018c41abf8de25f3c4
https://dspace.library.uu.nl/handle/1874/278892
https://dspace.library.uu.nl/handle/1874/278892
Autor:
Fagginger Auer, B.O., Bisseling, R.H., Bader, David A., Meyerhenke, Henning, Sanders, Peter, Wagner, Dorothea, Analysis, Sub Analysis begr. 01-01-2014
Publikováno v:
Graph Partitioning and Graph Clustering, 588, 19. American Mathematical Society
Graph Partitioning and Graph Clustering
Graph Partitioning and Graph Clustering
We investigate using the Mondriaan matrix partitioner for unweighted graph partitioning in the communication volume and edgecut metrics. By converting the unweighted graphs to appropriate matrices, we measure Mondriaan’s performance as a graph part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cba690fcd8dcea92237158b6c5f4af9
https://hdl.handle.net/1874/290188
https://hdl.handle.net/1874/290188
Autor:
Bisseling, R.H., Fagginger Auer, B.O., Yzelman, A.N., van Leeuwen, T., Catalyurek, U.V., Naumann, Uwe, Schenk, Olaf, Analysis, Sub Analysis begr. 01-01-2014
Publikováno v:
Combinatorial scientific computing, 321. CRC Press
STARTPAGE=321;TITLE=Combinatorial scientific computing
STARTPAGE=321;TITLE=Combinatorial scientific computing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::51e3ae54d571fd6b5555f185487098d2
https://dspace.library.uu.nl/handle/1874/379312
https://dspace.library.uu.nl/handle/1874/379312
Autor:
Fagginger Auer, B.O., Bisseling, R.H., Keller, Rainer, Kramer, David Anthony, Weiss, Jan-Philipp, Analysis, Sub Analysis begr. 01-01-2014
Publikováno v:
Facing the Multicore-Challenge II ISBN: 9783642303968
Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing, 108. Springer
ISSUE=7174;STARTPAGE=108;TITLE=Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing
Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing, 108. Springer
ISSUE=7174;STARTPAGE=108;TITLE=Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we intr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d2fb47d756cecea79b632274db45e1b
https://doi.org/10.1007/978-3-642-30397-5_10
https://doi.org/10.1007/978-3-642-30397-5_10
Autor:
van den Akker, J.M., Beelen, T., Bisseling, R.H., Fagginger Auer, B.O., von Heymann, F., Müller, T., Rommes, J., Planqué, Bob, Bhulai, Sandjai, Hulshof, Joost, Kager, Wouter, Rot, Thomas, Algorithmic Systems, Analyse, Analysis, Sub Algorithmic Systems begr. 01-01-2013, Sub Analysis begr. 01-01-2014, Dep Wiskunde
Publikováno v:
Proceedings of the 79th European Study Group Mathematics with Industry, 117. VU University Amsterdam
STARTPAGE=117;TITLE=Proceedings of the 79th European Study Group Mathematics with Industry
STARTPAGE=117;TITLE=Proceedings of the 79th European Study Group Mathematics with Industry
During the study week 2011 we worked on the question of how to automate certain aspects of the design of analog chips. Here we focused on the task of connecting different blocks with electrical wiring, which is particularly tedious to do by hand. For
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::2d7a1df3b13f9f67c21b243c88ec44f9
https://dspace.library.uu.nl/handle/1874/272522
https://dspace.library.uu.nl/handle/1874/272522
Conference
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.
Conference
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.