Zobrazeno 1 - 10
of 7 166
pro vyhledávání: '"A, Pasch"'
Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$-factor in $G$ is a subgraph of $G$ composed of $n/r$ vertex-disjoint copies of $F$, if $r$ divides $n$. In other words, an $F$-factor yields a partition of the $n$
Externí odkaz:
http://arxiv.org/abs/2411.14138
Offloading computationally expensive algorithms to the edge or even cloud offers an attractive option to tackle limitations regarding on-board computational and energy resources of robotic systems. In cloud-native applications deployed with the conta
Externí odkaz:
http://arxiv.org/abs/2410.18825
Consider the random $u$-uniform hypergraph (or $u$-graph) process on $n$ vertices, where $n$ is divisible by $r>u\ge 2$. It was recently shown that with high probability, as soon as every vertex is covered by a copy of the complete $u$-graph $K_r$, i
Externí odkaz:
http://arxiv.org/abs/2409.17764
Testing and evaluation of robotics systems is a difficult and oftentimes tedious task due to the systems' complexity and a lack of tools to conduct reproducible robotics experiments. Additionally, almost all available tools are either tailored toward
Externí odkaz:
http://arxiv.org/abs/2409.07080
Autor:
Krämer-Flecken, A., Proll, J. H. E., Weir, G., Costello, P., Fuchert, G., Geiger, J., Heuraux, S., Knieps, A., Langenberg, A., Mendes, S. Vaz, Pablant, N., Pasch, E., Rahbarnia, K., Sabot, R., Salazar, L., Smith, H. M., Thomsen, H., Windisch, T., Xiang, H. M., W7-X-team, the
In the past, quasi coherent modes were reported for nearly all tokamaks. The general definition describes modes as quasi coherent when the magnitude squared coherence is in the range of \SIrange{0.3}{0.6}{}. Quasi coherent modes are observed in the p
Externí odkaz:
http://arxiv.org/abs/2408.12900
This paper addresses the deduplication of multilingual textual data using advanced NLP tools. We compare a two-step method involving translation to English followed by embedding with mpnet, and a multilingual embedding model (distiluse). The two-step
Externí odkaz:
http://arxiv.org/abs/2406.13695
It is well-known that the $d$-dimensional hypercube contains a Hamilton cycle for $d\ge 2$. In this paper we address the analogous problem in the $3$-uniform cube hypergraph, a $3$-uniform analogue of the hypercube: for simple parity reasons, the $3$
Externí odkaz:
http://arxiv.org/abs/2406.00401
Autor:
Pasch, Stefan, Petridis, Dimitrios
In the context of the ACM KDF-SIGIR 2023 competition, we undertook an entity relation task on a dataset of financial entity relations called REFind. Our top-performing solution involved a multi-step approach. Initially, we inserted the provided entit
Externí odkaz:
http://arxiv.org/abs/2308.04534
Autor:
Merlo, Andrea, Pavone, Andrea, Böckenhoff, Daniel, Pasch, Ekkehard, Fuchert, Golo, Brunner, Kai Jakob, Rahbarnia, Kian, Schilling, Jonathan, Höfel, Udo, Kwak, Sehyun, Svensson, Jakob, Pedersen, Thomas Sunn, team, the W7-X
High-$\langle \beta \rangle$ operations require a fast and robust inference of plasma parameters with a self-consistent MHD equilibrium. Precalculated MHD equilibria are usually employed at W7-X due to the high computational cost. To address this, we
Externí odkaz:
http://arxiv.org/abs/2305.12889
In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let $r \ge 3 $ and let $n$ be divisible by $r$. Then, in the random $r$-uniform hypergraph process on $n$ vertices
Externí odkaz:
http://arxiv.org/abs/2302.08340