Zobrazeno 1 - 10
of 2 366
pro vyhledávání: '"A. Morawietz"'
Autor:
J. Küspert, I. Biało, R. Frison, A. Morawietz, L. Martinelli, J. Choi, D. Bucher, O. Ivashko, M. v Zimmermann, N. B. Christensen, D. G. Mazzone, G. Simutis, A. A. Turrini, L. Thomarat, D. W. Tam, M. Janoschek, T. Kurosawa, N. Momono, M. Oda, Qisi Wang, J. Chang
Publikováno v:
Communications Physics, Vol 7, Iss 1, Pp 1-6 (2024)
Abstract Unconventional superconductivity often couples to other electronic orders in a cooperative or competing fashion. Identifying external stimuli that tune between these two limits is of fundamental interest. Here, we show that strain perpendicu
Externí odkaz:
https://doaj.org/article/3661a771de38403b8d7b55781fd425d4
In the NP-hard Max $c$-Cut problem, one is given an undirected edge-weighted graph $G$ and aims to color the vertices of $G$ with $c$ colors such that the total weight of edges with distinctly colored endpoints is maximal. The case with $c=2$ is the
Externí odkaz:
http://arxiv.org/abs/2409.13380
Autor:
Balzereit, Kaja, Grüttemeier, Niels, Morawietz, Nils, Reinhardt, Dennis, Windmann, Stefan, Wolf, Petra
In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion time of the last job in the schedule. This notoriously NP-hard proble
Externí odkaz:
http://arxiv.org/abs/2409.00771
A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological order (temporal paths). This form of reachability is neither symmetric n
Externí odkaz:
http://arxiv.org/abs/2406.19514
Network sparsification is the task of reducing the number of edges of a given graph while preserving some crucial graph property. In community-aware network sparsification, the preserved property concerns the subgraphs that are induced by the communi
Externí odkaz:
http://arxiv.org/abs/2402.15494
We show that the simplest local search heuristics for two natural Euclidean clustering problems are PLS-complete. First, we show that the Hartigan--Wong method for $k$-Means clustering is PLS-complete, even when $k = 2$. Second, we show the same resu
Externí odkaz:
http://arxiv.org/abs/2312.14916
Autor:
Küspert, J., Biało, I., Frison, R., Morawietz, A., Martinelli, L., Choi, J., Bucher, D., Ivashko, O., Zimmermann, M. v., Christensen, N. B., Mazzone, D. G., Simutis, G., Turrini, A. A., Thomarat, L., Tam, D. W., Janoschek, M., Kurosawa, T., Momono, N., Oda, M., Wang, Qisi, Chang, J.
Publikováno v:
Commun Phys 7, 225 (2024)
Unconventional superconductivity often couples to other electronic orders in a cooperative or competing fashion. Identifying external stimuli that tune between these two limits is of fundamental interest. Here, we show that strain perpendicular to th
Externí odkaz:
http://arxiv.org/abs/2312.03650
The transport of excess protons and hydroxide ions in water underlies numerous important chemical and biological processes. Accurately simulating the associated transport mechanisms ideally requires utilizing ab initio molecular dynamics simulations
Externí odkaz:
http://arxiv.org/abs/2308.06348
Autor:
Oppliger, Jens, Denner, M. Michael, Küspert, Julia, Frison, Ruggero, Wang, Qisi, Morawietz, Alexander, Ivashko, Oleh, Dippel, Ann-Christin, von Zimmermann, Martin, Biało, Izabela, Martinelli, Leonardo, Fauqué, Benoît, Choi, Jaewon, Garcia-Fernandez, Mirian, Zhou, Ke-Jin, Christensen, Niels B., Kurosawa, Tohru, Momono, Naoki, Oda, Migaku, Natterer, Fabian D., Fischer, Mark H., Neupert, Titus, Chang, Johan
Publikováno v:
Nature Machine Intelligence (2024)
Removal or cancellation of noise has wide-spread applications for imaging and acoustics. In every-day-life applications, denoising may even include generative aspects, which are unfaithful to the ground truth. For scientific use, however, denoising m
Externí odkaz:
http://arxiv.org/abs/2209.09247
In Bayesian Network Structure Learning (BNSL), one is given a variable set and parent scores for each variable and aims to compute a DAG, called Bayesian network, that maximizes the sum of parent scores, possibly under some structural constraints. Ev
Externí odkaz:
http://arxiv.org/abs/2204.02902