Zobrazeno 1 - 10
of 2 178
pro vyhledávání: '"Brügge A"'
Autor:
van Brügge, Jan
Formal reasoning about the time complexity of algorithms and data structures is usually done in interactive theorem provers like Isabelle/HOL. This includes reasoning about amortized time complexity which looks at the worst case performance over a se
Externí odkaz:
http://arxiv.org/abs/2407.13671
Autor:
Emilia Brügge, Sarah Ricchizzi, Malin Arenbeck, Marius Niklas Keller, Lina Schur, Walter Stummer, Markus Holling, Max Hao Lu, Dogus Darici
Publikováno v:
BMC Medical Education, Vol 24, Iss 1, Pp 1-11 (2024)
Abstract Background Clinical decision-making (CDM) refers to physicians’ ability to gather, evaluate, and interpret relevant diagnostic information. An integral component of CDM is the medical history conversation, traditionally practiced on real o
Externí odkaz:
https://doaj.org/article/c771c26039c84ba1abb464c5ffdb6140
Autor:
Donath, Axel, Terrier, Régis, Remy, Quentin, Sinha, Atreyee, Nigro, Cosimo, Pintore, Fabio, Khélifi, Bruno, Olivera-Nieto, Laura, Ruiz, Jose Enrique, Brügge, Kai, Linhoff, Maximilian, Contreras, Jose Luis, Acero, Fabio, Aguasca-Cabot, Arnau, Berge, David, Bhattacharjee, Pooja, Buchner, Johannes, Boisson, Catherine, Fidalgo, David Carreto, Chen, Andrew, de Lavergne, Mathieu de Bony, Cardoso, José Vinícius de Miranda, Deil, Christoph, Füßling, Matthias, Funk, Stefan, Giunti, Luca, Hinton, Jim, Jouvin, Léa, King, Johannes, Lefaucheur, Julien, Lemoine-Goumard, Marianne, Lenain, Jean-Philippe, López-Coto, Rubén, Mohrmann, Lars, Morcuende, Daniel, Panny, Sebastian, Regeard, Maxime, Saha, Lab, Siejkowski, Hubert, Siemiginowska, Aneta, Sipőcz, Brigitta M., Unbehaun, Tim, van Eldik, Christopher, Vuillaume, Thomas, Zanin, Roberta
Publikováno v:
A&A 678, A157 (2023)
In this article, we present Gammapy, an open-source Python package for the analysis of astronomical $\gamma$-ray data, and illustrate the functionalities of its first long-term-support release, version 1.0. Built on the modern Python scientific ecosy
Externí odkaz:
http://arxiv.org/abs/2308.13584
Given an ascending chain $(I_n)_{n\in\mathbb{N}}$ of $\Sym$-invariant squarefree monomial ideals, we study the corresponding chain of Alexander duals $(I_n^\vee)_{n\in\mathbb{N}}$. Using a novel combinatorial tool, which we call \emph{avoidance up to
Externí odkaz:
http://arxiv.org/abs/2209.14132
Publikováno v:
In Journal of Cleaner Production 10 November 2024 479
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Combinatorics (December 11, 2023) dmtcs:9925
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs. For an Erd\H
Externí odkaz:
http://arxiv.org/abs/2204.07239
Autor:
von Bell, Matias, Braun, Benjamin, Bruegge, Kaitlin, Hanely, Derek, Peterson, Zachery, Serhiyenko, Khrystyna, Yip, Martha
The cone of nonnegative flows for a directed acyclic graph (DAG) is known to admit regular unimodular triangulations induced by framings of the DAG. These triangulations restrict to triangulations of the flow polytope for strength one flows, which ar
Externí odkaz:
http://arxiv.org/abs/2203.01896
Autor:
Braun, Benjamin, Bruegge, Kaitlin
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope for a conn
Externí odkaz:
http://arxiv.org/abs/2201.13303
Autor:
Barnes, Lydia, Birkinshaw, Timothy N., Senior, Aaron J., Brügge, Oscar Siles, Lewis, William, Argent, Stephen P., Moody, Christopher J., Nortcliffe, Andrew
Publikováno v:
In Bioorganic & Medicinal Chemistry 1 March 2024 101
Autor:
Chandrasekaran, Sandhya, Santibanez, Francisco, Long, Tyler, Nichols, Tim, Kait, Jason, Bruegge, Ruth Vorder, ‘Dale’ Bass, Cameron R., Pinton, Gianmarco
Publikováno v:
In Journal of Biomechanics March 2024 166