Zobrazeno 1 - 10 of 149 pro vyhledávání: '"Dora Giammarresi"'
1
Symmetric continuous subgraph matching with bidirectional dynamic programming
Autor: Sung Gwan Park, Giuseppe F. Italiano, Kunsoo Park, Dora Giammarresi, Seunghwan Min, Wook-Shin Han
Publikováno v: VLDB 201-47th International Conference on Very Large Data Bases
VLDB 201-47th International Conference on Very Large Data Bases, Aug 2021, Copenhagen, Denmark. pp.1298-1310, ⟨10.14778/3457390.3457395⟩
47th International Conference on Very Large Data Bases
47th International Conference on Very Large Data Bases, 2021, Copenhagen, Denmark. pp.1298-1310, ⟨10.14778/3457390.3457395⟩
VLDB 2021-47th International Conference on Very Large Data Bases
VLDB 2021-47th International Conference on Very Large Data Bases, Aug 2021, Copenhagen, Denmark. pp.1298-1310, ⟨10.14778/3457390.3457395⟩
International audience; 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 imp
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::032afde92b5db34552e939e84ac85a69
http://hdl.handle.net/11385/213005
Zobrazit plný text záznamu
2
Bad Pictures: Some Structural Properties Related to Overlaps
Autor: Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi
Publikováno v: Descriptional Complexity of Formal Systems ISBN: 9783030625351
DCFS
Given two pictures p and f, p is f-free if f is not a sub-picture of p. A binary picture f is good if for any pair of f-free pictures p and q there exists a bit-to-bit transformation from p to q such that any picture in the intermediate steps is f-fr
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f9b8a4c4d1ad9cb19167b282737982b
https://doi.org/10.1007/978-3-030-62536-8_2
Zobrazit plný text záznamu
4
Characterization and Measure of Infinite Two-dimensional Strong Prefix Codes
Autor: Dora Giammarresi, Marcella Anselmo, Maria Madonia
A set X ⊆ Σ + + of rectangular pictures over an alphabet Σ is a two-dimensional code if any picture over Σ is tilable in at most one way with pictures in X. Finite strong prefix codes were introduced as a family of decidable two-dimensional code
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5349fce5a4f86151f842c74306bc359d
http://hdl.handle.net/11386/4719735
Zobrazit plný text záznamu
5
Non-expandable non-overlapping sets of pictures
Autor: Maria Madonia, Marcella Anselmo, Dora Giammarresi
Publikováno v: Theoretical Computer Science. 657:127-136
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: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c3fd74dd938722474f6221aa26d6f63
https://doi.org/10.1016/j.tcs.2016.09.025
Zobrazit plný text záznamu
6
Full sets of pictures to encode pictures
Autor: Marcella Anselmo, Maria Madonia, Dora Giammarresi
A picture, or two-dimensional (2D) string, is a rectangular array of symbols over a finite alphabet. In this paper, we introduce the notion of fullness for sets of strings and sets of pictures. Fullness is a local counterpart of completeness. While i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ded99528ed11e3a604a564b4273c7b9
http://hdl.handle.net/11386/4719719
Zobrazit plný text záznamu
7
Encoding pictures with maximal codes of pictures
Autor: Maria Madonia, Dora Giammarresi, Marcella Anselmo
Publikováno v: SOFSEM 2018: Theory and Practice of Computer Science ISBN: 9783319731162
SOFSEM
A picture is a two-dimensional counterpart of a string and it is represented by a rectangular array of symbols over a finite alphabet \(\varSigma \). A set X of pictures over \(\varSigma \) is a code if every picture over \(\varSigma \) is tilable in
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a1e135962c659a471e97913dbb083bc
http://hdl.handle.net/2108/196843
Zobrazit plný text záznamu
8
Structure and properties of strong prefix codes of pictures
Autor: Maria Madonia, Marcella Anselmo, Dora Giammarresi
A setX⊆ Σ** of pictures is a code if every picture over Σ is tilable in at most one way with pictures inX. The definition ofstrong prefix codeis introduced. The family of finite strong prefix codes is decidable and it has a polynomial time decodi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd82d50ee83326fcce0ba115c46be1cb
http://hdl.handle.net/11386/4613857
Zobrazit plný text záznamu
9
Avoiding overlaps in pictures
Autor: Marcella Anselmo, Maria Madonia, Dora Giammarresi
Publikováno v: Lecture Notes in Computer Science
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.16-32, ⟨10.1007/978-3-319-60252-3_2⟩
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
Part 1: Invited Papers; International audience; In string combinatorics, the sets of strings that have no overlaps (i.e. the prefix of one string does not coincide with the suffix of another string) are extensively investigated since they play an imp
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9962a599a09d78165b5871fa51c356e0
http://hdl.handle.net/2108/196846
Zobrazit plný text záznamu
10
Infinite Two-dimensional Strong Prefix Codes: characterization and properties
Autor: Dora Giammarresi, Marcella Anselmo, Maria Madonia
Publikováno v: Cellular Automata and Discrete Complex Systems ISBN: 9783319586304
AUTOMATA
Lecture Notes in Computer Science
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.19-31, ⟨10.1007/978-3-319-58631-1_2⟩
Part 2: Regular Papers; International audience; A two-dimensional code is defined as a set of rectangular pictures over an alphabet $\varSigma $ such that any picture over $\varSigma $ is tilable in at most one way with pictures in X. It is in genera
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d903894bfaca916dba1ebb10afae6c1
http://hdl.handle.net/20.500.11769/94815
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje