Zobrazeno 1 - 10
of 2 461
pro vyhledávání: '"Rasmussen, A. M."'
Autor:
Zhang, Xuzhe, Wu, Yuhao, Angelini, Elsa, Li, Ang, Guo, Jia, Rasmussen, Jerod M., O'Connor, Thomas G., Wadhwa, Pathik D., Jackowski, Andrea Parolin, Li, Hai, Posner, Jonathan, Laine, Andrew F., Wang, Yun
Robust segmentation is critical for deriving quantitative measures from large-scale, multi-center, and longitudinal medical scans. Manually annotating medical scans, however, is expensive and labor-intensive and may not always be available in every d
Externí odkaz:
http://arxiv.org/abs/2303.09373
Autor:
Aaman, Anders, Karczmarz, Adam, Łącki, Jakub, Parotsidis, Nikos, Rasmussen, Peter M. R., Thorup, Mikkel
We present a dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions. The algorithm is Monte-Carlo randomized and processes any sequence of edge deletions in $O(m + n \operatorn
Externí odkaz:
http://arxiv.org/abs/2111.09376
Autor:
Campbell, Amanda J., Cakar, Samir, Palstrøm, Nicolai B., Riber, Lars P., Rasmussen, Lars M., Beck, Hans C.
Publikováno v:
In Molecular & Cellular Proteomics August 2024 23(8)
Autor:
Øhman, Elisabeth A, Fossli, Maria, Rasmussen, Kathleen M, Winkvist, Anna, Løland, Beate F, Holven, Kirsten B, Brekke, Hilde K
Publikováno v:
In The Journal of Nutrition August 2024 154(8):2448-2458
Publikováno v:
In Radiography March 2024 30(2):524-530
Autor:
Hansen, Susanne, Baastrup Søndergaard, Marianne, von Bülow, Anna, Bjerrum, Anne-Sofie, Schmid, Johannes, Rasmussen, Linda M., Johnsen, Claus R., Ingebrigtsen, Truls, Håkansson, Kjell Erik Julius, Johansson, Sofie Lock, Bisgaard, Maria, Assing, Karin Dahl, Hilberg, Ole, Ulrik, Charlotte, Porsbjerg, Celeste
Publikováno v:
In Chest February 2024 165(2):253-266
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give two polyn
Externí odkaz:
http://arxiv.org/abs/2011.10983
Publikováno v:
STOC 2021
We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by $O(n\log^{1/2}d/\log^{1/4-o(1)}n)$ for si
Externí odkaz:
http://arxiv.org/abs/2007.12819
Autor:
Aamand, Anders, Das, Debarati, Kipouridis, Evangelos, Knudsen, Jakob B. T., Rasmussen, Peter M. R., Thorup, Mikkel
To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probability using independent repetitions. Important examples of this approach
Externí odkaz:
http://arxiv.org/abs/2004.01156
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.