Filippo Mignosi

Orcid: 0000-0001-9599-5730

According to our database1, Filippo Mignosi authored at least 84 papers between 1989 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Portable Head-Mounted System for Mobile Forearm Tracking.
Sensors, April, 2024

Siamese network to assess scanner-related contrast variability in MRI.
Image Vis. Comput., 2024

Calibration of the Double Digital Twin for the Hand Rehabilitation by the Virtual Glove.
Proceedings of the 37th IEEE International Symposium on Computer-Based Medical Systems, 2024

Deep Learning Architecture analysis for EEG-Based BCI Classification under Motor Execution.
Proceedings of the 37th IEEE International Symposium on Computer-Based Medical Systems, 2024

2023
Hand Tracking and Gesture Recognition by Multiple Contactless Sensors: A Survey.
IEEE Trans. Hum. Mach. Syst., 2023

On the k-Hamming and k-Edit Distances.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept.
Proceedings of the 36th IEEE International Symposium on Computer-Based Medical Systems, 2023

Siamese Network to Investigate Scanner-Dependency in MRI.
Proceedings of the 36th IEEE International Symposium on Computer-Based Medical Systems, 2023

Graph Model to Represent Color Closeness in Pseudo-color Multimodal MRI.
Proceedings of the 36th IEEE International Symposium on Computer-Based Medical Systems, 2023

Graph model of phase lag index for connectivity analysis in EEG of emotions.
Proceedings of the 36th IEEE International Symposium on Computer-Based Medical Systems, 2023

2022
A 4D LSTM network for emotion recognition from the cross-correlation of the power spectral density of EEG signals.
Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2022

Compact, Accurate and Low-cost Hand Tracking System based on LEAP Motion Controllers and Raspberry Pi.
Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods, 2022

Optimizing Nozzle Travel Time in Proton Therapy.
Proceedings of the 35th IEEE International Symposium on Computer-Based Medical Systems, 2022

Investigating the Effectiveness of Color Coding in Multimodal Medical Imaging.
Proceedings of the 35th IEEE International Symposium on Computer-Based Medical Systems, 2022

Using Inductive Logic Programming to Globally Approximate Neural Networks for Preference Learning: Challenges and Preliminary Results.
Proceedings of 1st Workshop on Bias, 2022

2021
A Service for Supporting Digital and Immersive Cultural Experiences.
CoRR, 2021

Multiple Sclerosis Lesions Identification/Segmentation in Magnetic Resonance Imaging using Ensemble CNN and Uncertainty Classification.
CoRR, 2021

Using Deep Learning for Fast Dose Refinement in Proton Therapy.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

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.
Proceedings of the Advances in Visual Computing - 16th International Symposium, 2021

2020
Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields.
Probl. Inf. Transm., 2020

2019
Automated synthesis of application-layer connectors from automata-based specifications.
J. Comput. Syst. Sci., 2019

2018
On optimal parsing for LZ78-like compressors.
Theor. Comput. Sci., 2018

2017
Preface.
Theor. Comput. Sci., 2017

Abelian-square-rich words.
Theor. Comput. Sci., 2017

The longest common substring problem.
Math. Struct. Comput. Sci., 2017

2016
Abelian powers and repetitions in Sturmian words.
Theor. Comput. Sci., 2016

Linear-size suffix tries.
Theor. Comput. Sci., 2016

2015
Abelian Powers and Repetitions in Sturmian Words.
CoRR, 2015

Compressing Big Data: When the Rate of Convergence to the Entropy Matters.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Words with the Maximum Number of Abelian Squares.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
Note on the greedy parsing optimality for dictionary-based text compression.
Theor. Comput. Sci., 2014

Compressing Big Data: when the rate of convergence to the entropy matters.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

2013
Simple real-time constant-space string matching.
Theor. Comput. Sci., 2013

A New Complexity Function for Words Based on Periodicity.
Int. J. Algebra Comput., 2013

Abelian Repetitions in Sturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

The Rightmost Equal-Cost Position Problem.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Characteristic Sturmian words are extremal for the Critical Factorization Theorem.
Theor. Comput. Sci., 2012

Dictionary-symbolwise flexible parsing.
J. Discrete Algorithms, 2012

Sturmian graphs and integer representations over numeration systems.
Discret. Appl. Math., 2012

2010
On Lazy Representations and Sturmian Graphs.
Proceedings of the Implementation and Application of Automata, 2010

2009
From Nerode's congruence to suffix automata with mismatches.
Theor. Comput. Sci., 2009

2008
On the Longest Common Factor Problem.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
Languages with mismatches.
Theor. Comput. Sci., 2007

On Sturmian graphs.
Discret. Appl. Math., 2007

On the Suffix Automaton with Mismatches.
Proceedings of the Implementation and Application of Automata, 2007

2006
Word assembly through minimal forbidden words.
Theor. Comput. Sci., 2006

2005
Preface.
Theor. Comput. Sci., 2005

A multidimensional critical factorization theorem.
Theor. Comput. Sci., 2005

Minimal Forbidden Patterns of Multi-Dimensional Shifts.
Int. J. Algebra Comput., 2005

Languages with Mismatches and an Application to Approximate Indexing.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Sturmian Graphs and a Conjecture of Moser.
Proceedings of the Developments in Language Theory, 2004

A Trie-Based Approach for Compacting Automata.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
On Fine and Wilf's theorem for bidimensional words.
Theor. Comput. Sci., 2003

On a conjecture on bidimensional words.
Theor. Comput. Sci., 2003

Periodicity, morphisms, and matrices.
Theor. Comput. Sci., 2003

Computing forbidden words of regular languages.
Fundam. Informaticae, 2003

Indexing Structures for Approximate String Matching.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Words and forbidden factors.
Theor. Comput. Sci., 2002

A Note on a Conjecture of Duval and Sturmian Words.
RAIRO Theor. Informatics Appl., 2002

2001
Recurrence and periodicity in infinite words from local periods.
Theor. Comput. Sci., 2001

Forbidden Factors and Fragment Assembly.
RAIRO Theor. Informatics Appl., 2001

Variations on a Theorem of Fine & Wilf.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
Data compression using antidictionaries.
Proc. IEEE, 2000

The expressibility of languages and relations by word equations.
J. ACM, 2000

Forbidden Words in Symbolic Dynamics.
Adv. Appl. Math., 2000

1999
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words.
Theor. Comput. Sci., 1999

Text Compression Using Antidictionaries.
Proceedings of the Automata, 1999

Forbidden Factors in Finite and Infinite Words.
Proceedings of the Jewels are Forever, 1999

1998
Periodicity and the Golden Ratio.
Theor. Comput. Sci., 1998

Periodicities on Trees.
Theor. Comput. Sci., 1998

Automata and Forbidden Words.
Inf. Process. Lett., 1998

Minimal Forbidden Words and Factor Automata.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A lower bound for a constant in Shallit's conjecture.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
Minimal Forbidden Words and Symbolic Dynamics.
Proceedings of the STACS 96, 1996

1995
A Periodicity Theorem on Words and Applications.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Some Combinatorial Properties of Sturmian Words.
Theor. Comput. Sci., 1994

A Periodicity Theorem for Trees.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Generalizations of the Periodicity Theorem of Fine and Wilf.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups.
SIAM J. Discret. Math., 1993

If a D0L Language is k-Power Free then it is Circular.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Repetitions in the Fibonacci infinite word.
RAIRO Theor. Informatics Appl., 1992

1991
On the Number of Factors of Sturmian Words.
Theor. Comput. Sci., 1991

1990
Sturmian Words and Ambigous Context-Free Languages.
Int. J. Found. Comput. Sci., 1990

1989
Infinite Words with Linear Subword Complexity.
Theor. Comput. Sci., 1989


  Loading...