Zobrazeno 1 - 10
of 2 721
pro vyhledávání: '"A. Sedlar"'
Autor:
Sedlár, Igor
Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume that the fini
Externí odkaz:
http://arxiv.org/abs/2407.07570
Autor:
Bushuiev, Anton, Bushuiev, Roman, Sedlar, Jiri, Pluskal, Tomas, Damborsky, Jiri, Mazurenko, Stanislav, Sivic, Josef
In recent years, there has been remarkable progress in machine learning for protein-protein interactions. However, prior work has predominantly focused on improving learning algorithms, with less attention paid to evaluation strategies and data prepa
Externí odkaz:
http://arxiv.org/abs/2404.10457
Autor:
Chevallier, Sylvain, Carrara, Igor, Aristimunha, Bruno, Guetschel, Pierre, Sedlar, Sara, Lopes, Bruna, Velut, Sebastien, Khazem, Salim, Moreau, Thomas
Objective. This study conduct an extensive Brain-computer interfaces (BCI) reproducibility analysis on open electroencephalography datasets, aiming to assess existing solutions and establish open and reproducible benchmarks for effective comparison w
Externí odkaz:
http://arxiv.org/abs/2404.15319
The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g^{\prime},h^{\prime})$ of $G\diamond H$ are adjacent if $g=g^{\prime}$ and $hh^{\prime}\in E(H)$, or $gg^{\prime}\in E(G)$
Externí odkaz:
http://arxiv.org/abs/2404.02853
Autor:
Sedlar, Jelena, Škrekovski, Riste
A proper abelian coloring of a cubic graph G by a finite abelian group A is any proper edge-coloring of G by the non-zero elements of A such that the sum of the colors of the three edges incident to any vertex v of G equals zero. It is known that cyc
Externí odkaz:
http://arxiv.org/abs/2402.06008
Autor:
Sedlar, Jelena, Škrekovski, Riste
A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement that every b
Externí odkaz:
http://arxiv.org/abs/2312.08739
Autor:
Sedlár, Igor
We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the dynamic tes
Externí odkaz:
http://arxiv.org/abs/2311.06937
Autor:
Bushuiev, Anton, Bushuiev, Roman, Kouba, Petr, Filkin, Anatolii, Gabrielova, Marketa, Gabriel, Michal, Sedlar, Jiri, Pluskal, Tomas, Damborsky, Jiri, Mazurenko, Stanislav, Sivic, Josef
Discovering mutations enhancing protein-protein interactions (PPIs) is critical for advancing biomedical research and developing improved therapeutics. While machine learning approaches have substantially advanced the field, they often struggle to ge
Externí odkaz:
http://arxiv.org/abs/2310.18515
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a generalization
Externí odkaz:
http://arxiv.org/abs/2309.00922
Autor:
Bílková, Marta, Sedlár, Igor
Publikováno v:
EPTCS 379, 2023, pp. 113-130
Epistemic logics of intensional groups lift the assumption that membership in a group of agents is common knowledge. Instead of being represented directly as a set of agents, intensional groups are represented by a property that may change its extens
Externí odkaz:
http://arxiv.org/abs/2307.05056