Zobrazeno 1 - 10
of 1 210
pro vyhledávání: '"Muetze, A."'
Autor:
Behrooznia, Nastaran, Brenner, Sofia, Merino, Arturo, Mütze, Torsten, Rieck, Christian, Verciani, Francesco
We construct facet-Hamiltonian cycles in the $B$-permutahedron, resolving a conjecture raised in a recent paper by Akitaya, Cardinal, Felsner, Kleist and Lauff [arxiv.org/abs/2411.02172].
Externí odkaz:
http://arxiv.org/abs/2412.02584
In recent years, a body of works has emerged, studying shape and texture biases of off-the-shelf pre-trained deep neural networks (DNN) for image classification. These works study how much a trained DNN relies on image cues, predominantly shape and t
Externí odkaz:
http://arxiv.org/abs/2410.14878
Autor:
Behrooznia, Nastaran, Mütze, Torsten
We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs $G$ with faces of arbitrary lengths (no
Externí odkaz:
http://arxiv.org/abs/2409.15793
The associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces it by the
Externí odkaz:
http://arxiv.org/abs/2406.03783
In group sequential designs, where several data looks are conducted for early stopping, we generally assume the vector of test statistics from the sequential analyses follows (at least approximately or asymptotially) a multivariate normal distributio
Externí odkaz:
http://arxiv.org/abs/2404.12483
Autor:
Bell, James, Drury, Thomas, Mütze, Tobias, Pipper, Christian Bressen, Guizzaro, Lorenzo, Mitroiu, Marian, Rantell, Khadija Rerhou, Wolbers, Marcel, Wright, David
Estimands using the treatment policy strategy for addressing intercurrent events are common in Phase III clinical trials. One estimation approach for this strategy is retrieved dropout whereby observed data following an intercurrent event are used to
Externí odkaz:
http://arxiv.org/abs/2402.12850
Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$, which they called cup stacking. Stacks of cups are placed at the vertices of $G$, and are transferred between vertices via stacking moves, subject to cer
Externí odkaz:
http://arxiv.org/abs/2401.06189
Autor:
Fink, Jiří, Mütze, Torsten
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be extended
Externí odkaz:
http://arxiv.org/abs/2401.01769
Autor:
Mütze, Torsten, Namrata
For integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $S(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More generally, for
Externí odkaz:
http://arxiv.org/abs/2401.01681
Autor:
Bergfried, Christian, Späck-Leigsnering, Yvonne, Seebacher, Roland, Eickhoff, Heinrich, Muetze, Annette
Finite element models of electrical machines allow insights in electrothermal stresses which endanger the insulation system of the machine. This paper presents a thermal finite element model of a 3.7 kW squirrel-cage induction machine. The model reso
Externí odkaz:
http://arxiv.org/abs/2311.08821