Zobrazeno 1 - 10
of 2 739
pro vyhledávání: '"Sedlar, A."'
Autor:
Bushuiev, Anton, Bushuiev, Roman, Zadorozhny, Nikola, Samusevich, Raman, Stärk, Hannes, Sedlar, Jiri, Pluskal, Tomáš, Sivic, Josef
Data scarcity and distribution shifts often hinder the ability of machine learning models to generalize when applied to proteins and other biological data. Self-supervised pre-training on large datasets is a common method to enhance generalization. H
Externí odkaz:
http://arxiv.org/abs/2411.02109
A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest resolving set of G is called a metric basis. The metric dimension dim(
Externí odkaz:
http://arxiv.org/abs/2410.03656
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:
Gvozdenac, Sonja, Tanasković, Snežana, Krnjajic, S., Prvulović, D., Ovuka, Jelena, Sedlar, A.
Publikováno v:
Julius-Kühn-Archiv, Vol 463, Iss 2, Pp 829-834 (2018)
The use of natural inert dusts against storage insect pests is increasing recently, as an alternative to conventional insecticides. Laboratory study was carried out to evaluate the contact effect of three inert dusts, diatomaceous earth (DE), kaoline
Externí odkaz:
https://doaj.org/article/eb60f541d20f4299859442d52c8a615a
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