Zobrazeno 1 - 10
of 25 814
pro vyhledávání: '"A. Korhonen"'
Autor:
Korhonen, Tuukka
We present $k^{O(k^2)} m$ time algorithms for various problems about decomposing a given undirected graph by edge cuts or vertex separators of size $
Externí odkaz:
http://arxiv.org/abs/2411.02658
In 1985, W.K.Hayman (Bayer. Akad. Wiss. Math.-Natur. Kl. Sitzungsber, 1984(1985), 1-13.) proved that there do not exist non-constant meromorphic functions $f,$ $g$ and $h$ satisfying the functional equation $f^n+g^n+h^n=1$ for $n\geq 9.$ We prove tha
Externí odkaz:
http://arxiv.org/abs/2411.01509
Autor:
Bentert, Matthias, Fomin, Fedor V., Golovach, Petr A., Korhonen, Tuukka, Lochet, William, Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket, Simonov, Kirill
Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\"orklun
Externí odkaz:
http://arxiv.org/abs/2410.18878
In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that Hedge Cut ca
Externí odkaz:
http://arxiv.org/abs/2410.17641
The properties of functional brain networks are heavily influenced by how the network nodes are defined. A common approach uses Regions of Interest (ROIs), which are predetermined collections of fMRI measurement voxels, as network nodes. Their defini
Externí odkaz:
http://arxiv.org/abs/2410.05972
Autor:
Korhonen, Mikko
Let $G$ be the finite simple group of Lie type $G = E_7(q)$, where $q$ is an odd prime power. Then $G$ is an index $2$ subgroup of the adjoint group $G_{\operatorname{ad}}$, which is also denoted by $G_{\operatorname{ad}} = \operatorname{Inndiag}(G)$
Externí odkaz:
http://arxiv.org/abs/2409.20281
Autor:
Köksal, Abdullatif, Thaler, Marion, Imani, Ayyoob, Üstün, Ahmet, Korhonen, Anna, Schütze, Hinrich
Instruction tuning enhances large language models (LLMs) by aligning them with human preferences across diverse tasks. Traditional approaches to create instruction tuning datasets face serious challenges for low-resource languages due to their depend
Externí odkaz:
http://arxiv.org/abs/2409.12958
Autor:
Korhonen, Keijo, Vappula, Hetta, Glos, Adam, Cattaneo, Marco, Zimborás, Zoltán, Borrelli, Elsi-Mari, Rossi, Matteo A. C., García-Pérez, Guillermo, Cavalcanti, Daniel
Achieving high-precision measurements on near-term quantum devices is critical for advancing quantum computing applications. In this paper, we explore several practical techniques to enhance measurement accuracy using randomized measurements, focusin
Externí odkaz:
http://arxiv.org/abs/2409.02575
Autor:
Zhao, Raoyuan, Köksal, Abdullatif, Liu, Yihong, Weissweiler, Leonie, Korhonen, Anna, Schütze, Hinrich
Traditional benchmarking in NLP typically involves using static held-out test sets. However, this approach often results in an overestimation of performance and lacks the ability to offer comprehensive, interpretable, and dynamic assessments of NLP m
Externí odkaz:
http://arxiv.org/abs/2408.17437
Autor:
Fytas, Panagiotis, Breger, Anna, Selby, Ian, Baker, Simon, Shahipasand, Shahab, Korhonen, Anna
Developing imaging models capable of detecting pathologies from chest X-rays can be cost and time-prohibitive for large datasets as it requires supervision to attain state-of-the-art performance. Instead, labels extracted from radiology reports may s
Externí odkaz:
http://arxiv.org/abs/2408.04121