Zobrazeno 1 - 10
of 22 491
pro vyhledávání: '"J, Mark"'
Autor:
Ektefaie, Yasha, Viessmann, Olivia, Narayanan, Siddharth, Dresser, Drew, Kim, J. Mark, Mkrtchyan, Armen
Protein inverse folding-that is, predicting an amino acid sequence that will fold into the desired 3D structure-is an important problem for structure-based protein design. Machine learning based methods for inverse folding typically use recovery of t
Externí odkaz:
http://arxiv.org/abs/2410.17173
Autor:
Bull, J. Mark, Coughtrie, Andrew, Deeptimahanti, Deva, Hedley, Mark, Laoide-Kemp, Caoimhín, Maynard, Christopher, Shepherd, Harry, van de Bund, Sebastiaan, Weiland, Michèle, Went, Benjamin
This study presents scaling results and a performance analysis across different supercomputers and compilers for the Met Office weather and climate model, LFRic. The model is shown to scale to large numbers of nodes which meets the design criteria, t
Externí odkaz:
http://arxiv.org/abs/2409.15859
Casualty insurance-linked securities (ILS) are appealing to investors because the underlying insurance claims, which are directly related to resulting security performance, are uncorrelated with most other asset classes. Conversely, casualty ILS are
Externí odkaz:
http://arxiv.org/abs/2407.14666
The classical 3SUM conjecture states that the class of 3SUM-hard problems does not admit a truly subquadratic $O(n^{2-\delta})$-time algorithm, where $\delta >0$, in classical computing. The geometric 3SUM-hard problems have widely been studied in co
Externí odkaz:
http://arxiv.org/abs/2404.04535
Autor:
Keil, J. Mark, Mondal, Debajyoti
A disk graph is an intersection graph of disks in $\mathbb{R}^2$. Determining the computational complexity of finding a maximum clique in a disk graph is a long-standing open problem. In 1990, Clark, Colbourn, and Johnson gave a polynomial-time algor
Externí odkaz:
http://arxiv.org/abs/2404.03751