Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Morik, Marco"'
Autor:
Ciernik, Laure, Linhardt, Lorenz, Morik, Marco, Dippel, Jonas, Kornblith, Simon, Muttenthaler, Lukas
The Platonic Representation Hypothesis claims that recent foundation models are converging to a shared representation space as a function of their downstream task performance, irrespective of the objectives and data modalities used to train these mod
Externí odkaz:
http://arxiv.org/abs/2411.05561
Reconstructing brain sources is a fundamental challenge in neuroscience, crucial for understanding brain function and dysfunction. Electroencephalography (EEG) signals have a high temporal resolution. However, identifying the correct spatial location
Externí odkaz:
http://arxiv.org/abs/2411.00143
Diffusion models, trained on large amounts of data, showed remarkable performance for image synthesis. They have high error consistency with humans and low texture bias when used for classification. Furthermore, prior work demonstrated the decomposab
Externí odkaz:
http://arxiv.org/abs/2403.08469
Rankings are the primary interface through which many online platforms match users to items (e.g. news, products, music, video). In these two-sided markets, not only the users draw utility from the rankings, but the rankings also determine the utilit
Externí odkaz:
http://arxiv.org/abs/2005.14713
Autor:
Bentert, Matthias, Himmel, Anne-Sophie, Molter, Hendrik, Morik, Marco, Niedermeier, Rolf, Saitenmacher, René
Many real-world networks evolve over time, that is, new contacts appear and old contacts may disappear. They can be modeled as temporal graphs where interactions between vertices (which represent people in the case of social networks) are represented
Externí odkaz:
http://arxiv.org/abs/1806.10210
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is whether one
Externí odkaz:
http://arxiv.org/abs/1705.03673
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:
Bentert, Matthias, Himmel, Anne-Sophie, Molter, Hendrik, Morik, Marco, Niedermeier, Rolf, Saitenmacher, René
Publikováno v:
Journal of Experimental Algorithmics (JEA); 2019 Spl Issue, Vol. 24, p1-27, 27p
