Zobrazeno 1 - 10
of 3 393
pro vyhledávání: '"Schnider A"'
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in $GM_\mathcal{P}$ are conn
Externí odkaz:
http://arxiv.org/abs/2410.06139
Autor:
Daswani, Mayank, Bellaiche, Mathias M. J., Wilson, Marc, Ivanov, Desislav, Papkov, Mikhail, Schnider, Eva, Tang, Jing, Lamerigts, Kay, Botea, Gabriela, Sanchez, Michael A., Patel, Yojan, Prabhakara, Shruthi, Shetty, Shravya, Telang, Umesh
While multimodal foundation models can now natively work with data beyond text, they remain underutilized in analyzing the considerable amounts of multi-dimensional time-series data in fields like healthcare, finance, and social sciences, representin
Externí odkaz:
http://arxiv.org/abs/2410.02637
The Necklace Splitting problem is a classical problem in combinatorics that has been intensively studied both from a combinatorial and a computational point of view. It is well-known that the Necklace Splitting problem reduces to the discrete Ham San
Externí odkaz:
http://arxiv.org/abs/2408.17126
We present AuToMATo, a novel clustering algorithm based on persistent homology. While AuToMATo is not parameter-free per se, we provide default choices for its parameters that make it into an out-of-the-box clustering algorithm that performs well acr
Externí odkaz:
http://arxiv.org/abs/2408.06958
We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an upper bound,
Externí odkaz:
http://arxiv.org/abs/2407.06131
Imagine you are a dog behind a fence $Q$ and a hiker is passing by at constant speed along the hiking path $P$. In order to fulfil your duties as a watchdog, you desire to bark as long as possible at the human. However, your barks can only be heard i
Externí odkaz:
http://arxiv.org/abs/2402.13159
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the first algorit
Externí odkaz:
http://arxiv.org/abs/2402.12371
Autor:
Borzechowski, Michaela, Fearnley, John, Gordon, Spencer, Savani, Rahul, Schnider, Patrick, Weber, Simon
We provide polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity problem (P-LCP), finding the sink of a unique sink orientation (USO), and a variant of the $\alpha$-Ham Sandwich proble
Externí odkaz:
http://arxiv.org/abs/2402.07683
Autor:
Freyberg, Jan, Roy, Abhijit Guha, Spitz, Terry, Freeman, Beverly, Schaekermann, Mike, Strachan, Patricia, Schnider, Eva, Wong, Renee, Webster, Dale R, Karthikesalingam, Alan, Liu, Yun, Dvijotham, Krishnamurthy, Telang, Umesh
During the diagnostic process, doctors incorporate multimodal information including imaging and the medical history - and similarly medical AI development has increasingly become multimodal. In this paper we tackle a more subtle challenge: doctors ta
Externí odkaz:
http://arxiv.org/abs/2401.12032
Autor:
Schnider, Patrick, Weber, Simon
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise, it is NP-c
Externí odkaz:
http://arxiv.org/abs/2307.03446