Zobrazeno 1 - 10
of 3 183
pro vyhledávání: '"Chekan, A."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chekan, Vera, Geniet, Colin, Hatzel, Meike, Pilipczuk, Michał, Sokołowski, Marek, Seweryn, Michał T., Witkowski, Marcin
For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is non-null i
Externí odkaz:
http://arxiv.org/abs/2408.16344
The first algorithm for the Linear Quadratic (LQ) control problem with an unknown system model, featuring a regret of $\mathcal{O}(\sqrt{T})$, was introduced by Abbasi-Yadkori and Szepesv\'ari (2011). Recognizing the computational complexity of this
Externí odkaz:
http://arxiv.org/abs/2406.07746
Publikováno v:
World Literature Today, 2016 Dec 01. 90(6), 88-88.
Externí odkaz:
https://www.jstor.org/stable/10.7588/worllitetoda.90.6.0088
Autor:
Chekan, Vera, Kratsch, Stefan
In this work, we study two natural generalizations of clique-width introduced by Martin F\"urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while for fusion-width (fw) we have a possibility to merge all vertices
Externí odkaz:
http://arxiv.org/abs/2307.04628
Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat system. In Germany, this system helps voters to find candidates that a
Externí odkaz:
http://arxiv.org/abs/2307.01639
Autor:
Bergougnoux, Benjamin, Chekan, Vera, Ganian, Robert, Kanté, Mamadou Moustapha, Mnich, Matthias, Oum, Sang-il, Pilipczuk, Michał, van Leeuwen, Erik Jan
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming uses space
Externí odkaz:
http://arxiv.org/abs/2307.01285
Publikováno v:
Beilstein Journal of Organic Chemistry, Vol 20, Iss 1, Pp 1548-1559 (2024)
In recent years, genome and transcriptome mining have dramatically expanded the rate of discovering diverse natural products from bacteria and fungi. In plants, this approach is often more limited due to the lack of available annotated genomes and tr
Externí odkaz:
https://doaj.org/article/db0a579b8dcd493cbe458373acbf9249
Externally Forced Switched (EFS) systems represent a subset of switched systems where switches occur deliberately to meet an external requirement. However, fast switching can lead to instability, even when all closed-loop modes are stable. In this st
Externí odkaz:
http://arxiv.org/abs/2302.02270