Zobrazeno 1 - 10
of 16 426
pro vyhledávání: '"A, Liotta"'
Autor:
Lin, Yuxuan, Chang, Yang, Tong, Xuan, Yu, Jiawen, Liotta, Antonio, Huang, Guofan, Song, Wei, Zeng, Deyu, Wu, Zongze, Wang, Yan, Zhang, Wenqiang
In the advancement of industrial informatization, Unsupervised Industrial Anomaly Detection (UIAD) technology effectively overcomes the scarcity of abnormal samples and significantly enhances the automation and reliability of smart manufacturing. Whi
Externí odkaz:
http://arxiv.org/abs/2410.21982
Autor:
Förster, Henry, Klesen, Felix, Dwyer, Tim, Eades, Peter, Hong, Seok-Hee, Kobourov, Stephen G., Liotta, Giuseppe, Misue, Kazuo, Montecchiani, Fabrizio, Pastukhov, Alexander, Schreiber, Falk
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI-based question-answering
Externí odkaz:
http://arxiv.org/abs/2409.02907
Autor:
Bekos, Michael, Da Lozzo, Giordano, Frati, Fabrizio, Gupta, Siddharth, Kindermann, Philipp, Liotta, Giuseppe, Rutter, Ignaz, Tollis, Ioannis G.
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is $s$-span weakly
Externí odkaz:
http://arxiv.org/abs/2409.01889
Autor:
Angelini, Patrizio, Biedl, Therese, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Hong, Seok-Hee, Liotta, Giuseppe, Patrignani, Maurizio, Pupyrev, Sergey, Rutter, Ignaz, Wolff, Alexander
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which
Externí odkaz:
http://arxiv.org/abs/2409.01475
A Collaborative Artificial Intelligence System (CAIS) performs actions in collaboration with the human to achieve a common goal. CAISs can use a trained AI model to control human-system interaction, or they can use human interaction to dynamically le
Externí odkaz:
http://arxiv.org/abs/2401.12632
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the largest ratio b
Externí odkaz:
http://arxiv.org/abs/2311.14634
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{fram
Externí odkaz:
http://arxiv.org/abs/2311.13523
Publikováno v:
Testing Software and Systems. ICTSS 2023. Lecture Notes in Computer Science, vol 14131. Springer, Cham
A Collaborative Artificial Intelligence System (CAIS) works with humans in a shared environment to achieve a common goal. To recover from a disruptive event that degrades its performance and ensures its resilience, a CAIS may then need to perform a s
Externí odkaz:
http://arxiv.org/abs/2311.04569
Autor:
Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill
The problem of deciding whether a biconnected planar digraph $G=(V,E)$ can be augmented to become an $st$-planar graph by adding a set of oriented edges $E' \subseteq V \times V$ is known to be NP-complete. We show that the problem is fixed-parameter
Externí odkaz:
http://arxiv.org/abs/2309.15454
A pair $\langle G_0, G_1 \rangle$ of graphs admits a mutual witness proximity drawing $\langle \Gamma_0, \Gamma_1 \rangle$ when: (i) $\Gamma_i$ represents $G_i$, and (ii) there is an edge $(u,v)$ in $\Gamma_i$ if and only if there is no vertex $w$ in
Externí odkaz:
http://arxiv.org/abs/2309.01463