Segui
Arianna Pavone
Titolo
Citata da
Citata da
Anno
Linear and efficient string matching algorithms based on weak factor recognition
D Cantone, S Faro, A Pavone
Journal of Experimental Algorithmics (JEA) 24, 1-20, 2019
172019
An efficient skip-search approach to swap matching
S Faro, A Pavone, K Steinhofel
The Computer Journal 61 (9), 1351-1360, 2018
152018
Speeding up string matching by weak factor recognition
D Cantone, S Faro, A Pavone
arXiv preprint arXiv:1707.00469, 2017
122017
Efficient online string matching based on characters distance text sampling
S Faro, FP Marino, A Pavone
Algorithmica 82 (11), 3390-3412, 2020
82020
Quantum string matching unfolded and extended
D Cantone, S Faro, A Pavone
International Conference on Reversible Computation, 117-133, 2023
52023
Automatic extraction of semantic relations by using web statistical information
V Borzì, S Faro, A Pavone
Graph-Based Representation and Reasoning: 21st International Conference on …, 2014
52014
Sequence searching allowing for non-overlapping adjacent unbalanced translocations
D Cantone, S Faro, A Pavone
arXiv preprint arXiv:1812.00421, 2018
42018
Prior Polarity Lexical Resources for the Italian Language
V Borzì, S Faro, A Pavone, S Sansone
arXiv preprint arXiv:1507.00133, 2015
42015
How neurons in deep models relate with neurons in the brain
A Pavone, A Plebe
Algorithms 14 (9), 272, 2021
32021
Enhancing Characters Distance Text Sampling by Condensed Alphabets.
S Faro, FP Marino, A Pavone
ICTCS, 1-15, 2021
22021
Neural Semantic Pointers in Context.
A Plebe, A Pavone
IJCCI, 447-454, 2020
22020
The Quantum Cyclic Rotation Gate.
A Pavone, C Viola
ICTCS, 206-218, 2023
12023
Improved characters distance sampling for online and offline text searching
S Faro, FP Marino, A Pavone
Theoretical Computer Science 946, 113684, 2023
12023
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.
S Faro, FP Marino, A Pavone, A Scardace
Stringology, 75-89, 2021
12021
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors
S Faro, A Pavone
International Work-Conference on Bioinformatics and Biomedical Engineering …, 2019
12019
Flexible and Efficient Algorithms for Abelian Matching in Strings
S Faro, A Pavone
arXiv preprint arXiv:1803.02807, 2018
12018
Quantum Circuits for Fixed Matching Substring Problems
D Cantone, S Faro, A Pavone, C Viola
Science and Information Conference, 667-686, 2024
2024
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching
S Faro, A Pavone, C Viola
Annual Conference on Theory and Applications of Models of Computation, 247-259, 2024
2024
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples
S Faro, FP Marino, A Moschetto, A Pavone, A Scardace
12th International Conference on Fun with Algorithms (FUN 2024), 2024
2024
Longest Common Substring and Longest Palindromic Substring in Time
D Cantone, S Faro, A Pavone, C Viola
arXiv preprint arXiv:2309.01250, 2023
2023
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20