Zobrazeno 1 - 10
of 2 831
pro vyhledávání: '"Kratochvil, P"'
Autor:
Goel, Shrey, Thoutam, Vishrut, Marroquin, Edgar Mariano, Gokaslan, Aaron, Firouzbakht, Arash, Vincoff, Sophia, Kuleshov, Volodymyr, Kratochvil, Huong T., Chatterjee, Pranam
Masked Diffusion Language Models (MDLMs) have recently emerged as a strong class of generative models, paralleling state-of-the-art (SOTA) autoregressive (AR) performance across natural language modeling domains. While there have been advances in AR
Externí odkaz:
http://arxiv.org/abs/2410.16735
Autor:
Musálek, Tomáš, Liška, Petr, Morsa, Amedeo, Arregi, Jon Ander, Kratochvíl, Matouš, Sergeev, Dmitry, Müller, Michael, Šikola, Tomáš, Kolíbal, Miroslav
Inorganic halide perovskites have become attractive for many optoelectronic applications due to their outstanding properties. While chemical synthesis techniques have been successful in producing high-quality perovskite crystals, scaling up to wafer-
Externí odkaz:
http://arxiv.org/abs/2409.18294
Autor:
Jedličková, Nikola, Kratochvíl, Jan
A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and restricted cl
Externí odkaz:
http://arxiv.org/abs/2403.03668
We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called teaching d
Externí odkaz:
http://arxiv.org/abs/2402.04907
Autor:
Jedličková, Nikola, Kratochvíl, Jan
A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to the first p
Externí odkaz:
http://arxiv.org/abs/2309.09228
Autor:
Cornelsen, Sabine, Da Lozzo, Giordano, Grilli, Luca, Gupta, Siddharth, Kratochvíl, Jan, Wolff, Alexander
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line drawing of
Externí odkaz:
http://arxiv.org/abs/2308.15416
Autor:
Morales, Nicolas Zorn, Rühl, Daniel Steffen, Sadofev, Sergey, Ligorio, Giovanni, List-Kratochvil, Emil, Kewes, Günter, Blumstengel, Sylke
Monolayer (1L) transition metal dichalcogenides (TMDC) are of strong interest in nanophotonics due to their narrow-band intense excitonic transitions persisting up to room temperature. When brought into resonance with surface plasmon polariton (SPP)
Externí odkaz:
http://arxiv.org/abs/2306.16107
We study the following problem: Given a set $S$ of $n$ points in the plane, how many edge-disjoint plane straight-line spanning paths of $S$ can one draw? A well known result is that when the $n$ points are in convex position, $\lfloor n/2\rfloor$ su
Externí odkaz:
http://arxiv.org/abs/2306.07237
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and complexity persp
Externí odkaz:
http://arxiv.org/abs/2306.06431
Autor:
Jabandziev Petr, Hubacek Jaroslav Alois, Michalek Jaroslav, Jouza Martin, Papez Jan, Pecl Jakub, Slaba Katerina, Slaby Ondrej, Urik Milan, Aulicka Stefania, Kunovsky Lumir, Dominik Petr, Kratochvil Milan, Klucka Jozef, Stourac Petr
Publikováno v:
Romanian Journal of Internal Medicine, Vol 62, Iss 3, Pp 279-285 (2024)
Sepsis is one of the most common causes of death in patients admitted to intensive care units (ICUs). The development of sepsis is significantly influenced by genetic predisposition. In this study, we highlight a potential association between a varia
Externí odkaz:
https://doaj.org/article/b7b44aafc8854c1b9690e272645d972f
