Zobrazeno 1 - 10
of 71
pro vyhledávání: '"GIAMMARRESI, DORA"'
Autor:
Min, Seunghwan, Jang, Jihoon, Park, Kunsoo, Giammarresi, Dora, Italiano, Giuseppe F., Han, Wook-Shin
Real-time analysis of graphs containing temporal information, such as social media streams, Q&A networks, and cyber data sources, plays an important role in various applications. Among them, detecting patterns is one of the fundamental graph analysis
Externí odkaz:
http://arxiv.org/abs/2312.10486
Autor:
Anselmo, Marcella, Castiglione, Giuseppa, Flores, Manuela, Giammarresi, Dora, Madonia, Maria, Mantaci, Sabrina
The hypercube of dimension n is the graph whose vertices are the 2^n binary words of length n, and there is an edge between two of them if they have Hamming distance 1. We consider an edit distance based on swaps and mismatches, to which we refer as
Externí odkaz:
http://arxiv.org/abs/2303.09898
Autor:
Anselmo, Marcella, Castiglione, Giuseppa, Flores, Manuela, Giammarresi, Dora, Madonia, Maria, Mantaci, Sabrina
An edit distance is a metric between words that quantifies how two words differ by counting the number of edit operations needed to transform one word into the other one. A word f is said isometric with respect to an edit distance if, for any pair of
Externí odkaz:
http://arxiv.org/abs/2303.03086
Autor:
Min, Seunghwan, Park, Sung Gwan, Park, Kunsoo, Giammarresi, Dora, Italiano, Giuseppe F., Han, Wook-Shin
In many real datasets such as social media streams and cyber data sources, graphs change over time through a graph update stream of edge insertions and deletions. Detecting critical patterns in such dynamic graphs plays an important role in various a
Externí odkaz:
http://arxiv.org/abs/2104.00886
The non-overlapping sets of pictures are sets such that no two pictures in the set (properly) overlap. They are the generalization to two dimensions of the cross-bifix-free sets of strings. Non-overlapping sets of pictures are non-expandable when no
Externí odkaz:
http://arxiv.org/abs/1605.09061
Publikováno v:
In Information and Computation October 2020 274
Autor:
Giammarresi, Dora
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership p
Externí odkaz:
http://arxiv.org/abs/1012.0672
Publikováno v:
In Information and Computation April 2017 253 Part 3:358-370
Autor:
Anselmo, Marcella1 (AUTHOR) manselmo@unisa.it, Giammarresi, Dora2 (AUTHOR) giammarr@mat.uniroma2.it, Madonia, Maria3 (AUTHOR) madonia@dmi.unict.it, Dennunzio, Alberto (AUTHOR), Păun, Gheorghe (AUTHOR), Rozenberg, Grzegorz (AUTHOR), Zandron, Claudio (AUTHOR)
Publikováno v:
Fundamenta Informaticae. 2020, Vol. 171 Issue 1-4, p1-17. 17p.
Publikováno v:
In Theoretical Computer Science 2009 410(37):3520-3529