default search action
Filippo Mignosi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j45]Matteo Polsinelli, Hongwei Bran Li, Filippo Mignosi, Li Zhang, Giuseppe Placidi:
Siamese network to assess scanner-related contrast variability in MRI. Image Vis. Comput. 145: 104997 (2024) - [j44]Matteo Polsinelli, Alessandro Di Matteo
, Daniele Lozzi
Portable Head-Mounted System for Mobile Forearm Tracking. Sensors 24(7): 2227 (2024) - [c41]Alessandro Di Matteo, Daniele Lozzi
Calibration of the Double Digital Twin for the Hand Rehabilitation by the Virtual Glove. CBMS 2024: 521-526 - [c40]Enrico Mattei
Deep Learning Architecture analysis for EEG-Based BCI Classification under Motor Execution. CBMS 2024: 549-555 - 2023
- [j43]Eleni Theodoridou
Hand Tracking and Gesture Recognition by Multiple Contactless Sensors: A Survey. IEEE Trans. Hum. Mach. Syst. 53(1): 35-43 (2023) - [c39]Daniele Lozzi
Graph model of phase lag index for connectivity analysis in EEG of emotions. CBMS 2023: 348-353 - [c38]Alessandro Pio, Giovanna Castellano, Filippo Mignosi, Giuseppe Placidi, Matteo Polsinelli, Alessandro Sciarra, Gennaro Vessio:
Graph Model to Represent Color Closeness in Pseudo-color Multimodal MRI. CBMS 2023: 456-462 - [c37]Matteo Polsinelli, Luigi Cinque, Filippo Mignosi, Giuseppe Placidi, Genoveffa Tortora:
Siamese Network to Investigate Scanner-Dependency in MRI. CBMS 2023: 535-541 - [c36]Matteo Spezialetti, Ramon Gimenez De Lorenzo, Giovanni Luca Gravina, Giuseppe Placidi, Fabrizio Rossi
Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept. CBMS 2023: 548-554 - [c35]Chiara Epifanio, Luca Forlizzi, Francesca Marzi, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. ICTCS 2023: 143-156 - [i10]Chiara Epifanio, Luca Forlizzi, Francesca Marzi
On the k-Hamming and k-Edit Distances. CoRR abs/2306.09144 (2023) - 2022
- [c34]Daniele Fossemò, Filippo Mignosi, Luca Raggioli, Matteo Spezialetti, Fabio Aurelio D'Asaro:
Using Inductive Logic Programming to Globally Approximate Neural Networks for Preference Learning: Challenges and Preliminary Results. BEWARE@AI*IA 2022: 67-83 - [c33]Giuseppe Placidi
Investigating the Effectiveness of Color Coding in Multimodal Medical Imaging. CBMS 2022: 270-275 - [c32]Matteo Spezialetti, Renata Di Filippo, Ramon Gimenez De Lorenzo
Optimizing Nozzle Travel Time in Proton Therapy. CBMS 2022: 441-446 - [c31]Giuseppe Placidi, Alessandro Di Matteo
Compact, Accurate and Low-cost Hand Tracking System based on LEAP Motion Controllers and Raspberry Pi. ICPRAM 2022: 652-659 - [c30]Daniele Lozzi
A 4D LSTM network for emotion recognition from the cross-correlation of the power spectral density of EEG signals. WI/IAT 2022: 652-657 - 2021
- [c29]Giuseppe Placidi
Integration of a BCI with a Hand Tracking System and a Motorized Robotic Arm to Improve Decoding of Brain Signals Related to Hand and Finger Movements. ISVC (1) 2021: 305-315 - [c28]Matteo Spezialetti, Fulvio Lapenna, Pasquale Caianiello, Francesco Fracchiolla, Federico Muciaccia
Using Deep Learning for Fast Dose Refinement in Proton Therapy. SMC 2021: 1783-1789 - [i9]Giuseppe Placidi, Luigi Cinque, Filippo Mignosi, Matteo Polsinelli:
Multiple Sclerosis Lesions Identification/Segmentation in Magnetic Resonance Imaging using Ensemble CNN and Uncertainty Classification. CoRR abs/2108.11791 (2021) - [i8]Karthik Vaidhyanathan, Antonio Bruno, Eleonora Mendola, Filippo Mignosi, Mahyar Tourchi Moghaddam, Henry Muccini, Monica Nesi:
A Service for Supporting Digital and Immersive Cultural Experiences. CoRR abs/2109.07900 (2021) - 2020
- [j42]Riccardo Aragona
Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields. Probl. Inf. Transm. 56(1): 13-22 (2020)
2010 – 2019
- 2019
- [j41]Marco Autili
Automated synthesis of application-layer connectors from automata-based specifications. J. Comput. Syst. Sci. 104: 17-40 (2019) - [i7]Riccardo Aragona, Francesca Marzi, Filippo Mignosi, Matteo Spezialetti:
Entropy and Compression: A simple proof of an inequality of Khinchin-Ornstein-Shields. CoRR abs/1907.04713 (2019) - 2018
- [j40]Salvatore Aronica, Alessio Langiu
On optimal parsing for LZ78-like compressors. Theor. Comput. Sci. 710: 19-28 (2018) - 2017
- [j39]Maxime Crochemore
The longest common substring problem. Math. Struct. Comput. Sci. 27(2): 277-295 (2017) - [j38]Dora Giammarresi, Sabrina Mantaci, Marinella Sciortino, Filippo Mignosi:
Preface. Theor. Comput. Sci. 658: 1-3 (2017) - [j37]Gabriele Fici
Abelian-square-rich words. Theor. Comput. Sci. 684: 29-42 (2017) - [i6]Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit:
Abelian-Square-Rich Words. CoRR abs/1701.00948 (2017) - 2016
- [j36]Gabriele Fici
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - [j35]Maxime Crochemore
Linear-size suffix tries. Theor. Comput. Sci. 638: 171-178 (2016) - 2015
- [c27]Gabriele Fici
Words with the Maximum Number of Abelian Squares. WORDS 2015: 122-134 - [c26]Marco Autili
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications. LATA 2015: 3-24 - [c25]Salvatore Aronica, Alessio Langiu, Francesca Marzi, Salvatore Mazzola, Filippo Mignosi
Compressing Big Data: When the Rate of Convergence to the Entropy Matters. MACIS 2015: 285-289 - [i5]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Powers and Repetitions in Sturmian Words. CoRR abs/1506.02797 (2015) - [i4]Gabriele Fici, Filippo Mignosi:
Words with the Maximum Number of Abelian Squares. CoRR abs/1506.03562 (2015) - 2014
- [j34]Maxime Crochemore
Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. 525: 55-59 (2014) - [c24]Filippo Mignosi:
Compressing Big Data: when the rate of convergence to the entropy matters. ICABD 2014: 7-8 - 2013
- [j33]Filippo Mignosi
A New Complexity Function for Words Based on Periodicity. Int. J. Algebra Comput. 23(4): 963-988 (2013) - [j32]Dany Breslauer, Roberto Grossi, Filippo Mignosi
Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013) - [c23]Maxime Crochemore
The Rightmost Equal-Cost Position Problem. DCC 2013: 421-430 - [c22]Gabriele Fici
Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238 - 2012
- [j31]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit:
Sturmian graphs and integer representations over numeration systems. Discret. Appl. Math. 160(4-5): 536-547 (2012) - [j30]Maxime Crochemore, Laura Giambruno, Alessio Langiu
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012) - [j29]Filippo Mignosi
Characteristic Sturmian words are extremal for the Critical Factorization Theorem. Theor. Comput. Sci. 454: 199-205 (2012) - [i3]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012) - [i2]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012) - [i1]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012) - 2011
- [c21]Dany Breslauer, Roberto Grossi, Filippo Mignosi
Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183 - 2010
- [c20]Maxime Crochemore, Laura Giambruno, Alessio Langiu
Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403 - [c19]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi
On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134
2000 – 2009
- 2009
- [j28]Maxime Crochemore
From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. 410(37): 3471-3480 (2009) - 2008
- [c18]Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi:
On the Longest Common Factor Problem. IFIP TCS 2008: 143-155 - 2007
- [j27]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
On Sturmian graphs. Discret. Appl. Math. 155(8): 1014-1030 (2007) - [j26]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Languages with mismatches. Theor. Comput. Sci. 385(1-3): 152-166 (2007) - [c17]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
On the Suffix Automaton with Mismatches. CIAA 2007: 144-156 - 2006
- [j25]Gabriele Fici
Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006) - 2005
- [j24]Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi:
Minimal Forbidden Patterns of Multi-Dimensional Shifts. Int. J. Algebra Comput. 15(1): 73-93 (2005) - [j23]Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg:
Preface. Theor. Comput. Sci. 340(1): 179-185 (2005) - [j22]Chiara Epifanio, Filippo Mignosi:
A multidimensional critical factorization theorem. Theor. Comput. Sci. 346(2-3): 265-280 (2005) - [c16]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
Languages with Mismatches and an Application to Approximate Indexing. Developments in Language Theory 2005: 224-235 - 2004
- [c15]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158 - [c14]Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini:
Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory 2004: 175-187 - 2003
- [j21]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - [j20]Filippo Mignosi, Antonio Restivo, Pedro V. Silva
On Fine and Wilf's theorem for bidimensional words. Theor. Comput. Sci. 292(1): 245-262 (2003) - [j19]Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani:
Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003) - [j18]Chiara Epifanio, Michel Koskas, Filippo Mignosi:
On a conjecture on bidimensional words. Theor. Comput. Sci. 299(1-3): 123-150 (2003) - [c13]Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Indexing Structures for Approximate String Matching. CIAC 2003: 140-151 - 2002
- [j17]Filippo Mignosi, Luca Q. Zamboni:
A Note on a Conjecture of Duval and Sturmian Words. RAIRO Theor. Informatics Appl. 36(1): 1-3 (2002) - [j16]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Words and forbidden factors. Theor. Comput. Sci. 273(1-2): 99-117 (2002) - 2001
- [j15]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. RAIRO Theor. Informatics Appl. 35(6): 565-577 (2001) - [j14]Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo:
Recurrence and periodicity in infinite words from local periods. Theor. Comput. Sci. 262(1): 269-284 (2001) - [c12]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. Developments in Language Theory 2001: 349-358 - [c11]Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang:
Variations on a Theorem of Fine & Wilf. MFCS 2001: 512-523 - 2000
- [j13]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. 25(2): 163-193 (2000) - [j12]Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski:
The expressibility of languages and relations by word equations. J. ACM 47(3): 483-505 (2000) - [j11]Maxime Crochemore
Data compression using antidictionaries. Proc. IEEE 88(11): 1756-1768 (2000)
1990 – 1999
- 1999
- [j10]Maria Gabriella Castelli, Filippo Mignosi, Antonio Restivo:
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words. Theor. Comput. Sci. 218(1): 83-94 (1999) - [c10]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors in Finite and Infinite Words. Jewels are Forever 1999: 339-350 - [c9]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Text Compression Using Antidictionaries. ICALP 1999: 261-270 - 1998
- [j9]Maxime Crochemore
Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998) - [j8]Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Periodicity and the Golden Ratio. Theor. Comput. Sci. 204(1-2): 153-167 (1998) - [j7]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo:
Periodicities on Trees. Theor. Comput. Sci. 205(1-2): 145-181 (1998) - [c8]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673 - 1997
- [c7]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture. Developments in Language Theory 1997: 103-118 - [c6]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
The Expressibility of Languages and Relations by Word Equations. ICALP 1997: 98-109 - 1996
- [c5]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics. STACS 1996: 555-566 - 1995
- [c4]Filippo Mignosi, Antonio Restivo, Sergio Salemi:
A Periodicity Theorem on Words and Applications. MFCS 1995: 337-348 - 1994
- [j6]Aldo de Luca, Filippo Mignosi:
Some Combinatorial Properties of Sturmian Words. Theor. Comput. Sci. 136(2): 361-285 (1994) - [c3]Raffaele Giancarlo, Filippo Mignosi:
Generalizations of the Periodicity Theorem of Fine and Wilf. CAAP 1994: 130-141 - [c2]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo:
A Periodicity Theorem for Trees. IFIP Congress (1) 1994: 473-478 - 1993
- [j5]Antonio Machi, Filippo Mignosi:
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups. SIAM J. Discret. Math. 6(1): 44-56 (1993) - [c1]Filippo Mignosi, Patrice Séébold:
If a D0L Language is k-Power Free then it is Circular. ICALP 1993: 507-518 - 1992
- [j4]Filippo Mignosi, Giuseppe Pirillo:
Repetitions in the Fibonacci infinite word. RAIRO Theor. Informatics Appl. 26: 199-204 (1992) - 1991
- [j3]Filippo Mignosi:
On the Number of Factors of Sturmian Words. Theor. Comput. Sci. 82(1): 71-84 (1991) - 1990
- [j2]Filippo Mignosi:
Sturmian Words and Ambigous Context-Free Languages. Int. J. Found. Comput. Sci. 1(3): 309-324 (1990)
1980 – 1989
- 1989
- [j1]Filippo Mignosi:
Infinite Words with Linear Subword Complexity. Theor. Comput. Sci. 65(2): 221-242 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: