Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Geiß, Manuela"'
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved tr
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A84898
https://ul.qucosa.de/api/qucosa%3A84898/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A84898/attachment/ATT-0/
In the past few years, object detection has attracted a lot of attention in the context of human-robot collaboration and Industry 5.0 due to enormous quality improvements in deep learning technologies. In many applications, object detection models ha
Externí odkaz:
http://arxiv.org/abs/2206.00280
Autor:
Geiß, Manuela, Baresch, Martin, Chasparis, Georgios, Schweiger, Edwin, Teringl, Nico, Zwick, Michael
We present an end-to-end framework for fast retraining of object detection models in human-robot-collaboration. Our Faster R-CNN based setup covers the whole workflow of automatic image generation and labeling, model retraining on-site as well as inf
Externí odkaz:
http://arxiv.org/abs/2204.00597
Autor:
Sobieczky, Florian, Geiß, Manuela
A local surrogate for an AI-model correcting a simpler 'base' model is introduced representing an analytical method to yield explanations of AI-predictions. The approach is studied here in the context of the base model being linear regression. The AI
Externí odkaz:
http://arxiv.org/abs/2103.07155
Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics and can be approximated with the help of similarity measures between gene sequences, albeit not without errors. The corresponding graph editi
Externí odkaz:
http://arxiv.org/abs/2103.07280
Autor:
Geiß, Manuela
Orthology detection is an important task within the context of genome an- notation, gene nomenclature, and the understanding of gene evolution. With the rapidly accelerating pace at which new genomes become available, highly efficient methods are urg
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A36032
https://ul.qucosa.de/api/qucosa%3A36032/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A36032/attachment/ATT-0/
2-colored best match graphs (2-BMGs) form a subclass of sink-free bi-transitive graphs that appears in phylogenetic combinatorics. There, 2-BMGs describe evolutionarily most closely related genes between a pair of species. They are explained by a uni
Externí odkaz:
http://arxiv.org/abs/2101.07000
Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to determine whether a BMG is binary-explainable, i.e., whether it can be
Externí odkaz:
http://arxiv.org/abs/2011.00511
Genome-scale orthology assignments are usually based on reciprocal best matches. In the absence of horizontal gene transfer (HGT), every pair of orthologs forms a reciprocal best match. Incorrect orthology assignments therefore are always false posit
Externí odkaz:
http://arxiv.org/abs/2006.02249
Autor:
Valdivia, Dulce I., Geiß, Manuela, Rosales, Maribel Hernández, Stadler, Peter F., Hellmuth, Marc
Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $\chi(G)$. We show that greedy colorings are a special case of
Externí odkaz:
http://arxiv.org/abs/2004.06340