Simone FARO

Professore associato di INFORMATICA [INF/01]
Ufficio: Stanza n.366 del DMI, stanza n.305 del DISUM
Email: faro@dmi.unict.it
Sito web: www.dmi.unict.it/~faro/
Orario di ricevimento: Consultare il seguente link


Per gli orari e i prossimi giorni di ricevimento consultare il seguente link

Tutte le informazioni relative all'esame di Abilità Informatiche (Dipartimento di Scienze Umanistiche) possono essere reperite sul sito internet del corso, all'indirizzo: https://www.dmi.unict.it/~faro/infdisum/esami/abinform.php

Le risposte alle domande frequenti relative all'esame di Abilità Informatiche possono essere trovate all'indirizzo web: https://www.dmi.unict.it/~faro/infdisum/esami/faq.php

Informazioni sull'attività di ricerca del docente possono essere consultate al seguente link

Il docente ha pubblicato 72 articoli nel corso della sua attività di ricerca iniziata nel 2003.
In base alle statistiche calcolate da Google Scholar, il suo h-index è pari 17 mentre il suo i10-index è pari a 25

Lista degli articoli pubblicati su riviste internazionali

[19]

Engineering Order-Preserving Pattern Matching with SIMD Parallelism

Software: Practice and Experience, to appear
By Chhabra Tamanna, Simone Faro and Oguzhan Kulekci
Published in 2016

[18]

Text Searching Allowing for Inversions and Translocations of Factors

Discrete Applied Mathematics, Vol.163: pp.247-257
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2014

[17]

Fast Shortest-Paths Algorithms in the Presence of few Destinations of Negative-Weight Arcs

Journal of Discrete Algorithms, Vol.24: pp.12-25
By Domenico Cantone and Simone Faro
Published in 2014

[16]

Fast and Flexible Packed String Matching

Journal of Discrete Algorithms, Vol.28: pp.61-72
By Simone Faro and Oguzhan Kulekci
Published in 2014

[15]

Improved and Self-Tuned Occurrence Heuristics

Journal of Discrete Algorithms, Vol.28: pp.73-84
By Domenico Cantone and Simone Faro
Published in 2014

[14]

Efficient String-Matching Allowing for Non-Overlapping Inversions

Theoretical Computer Science, Vol.483: pp.85-95
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2013

[13]

The Exact Online String Matching Problem: a Review of the Most Recent Results

ACM Computing Surveys, Vol. 45(2): pages 13
By Simone Faro and Thierry Lecroq
Published in 2013

[12]

Efficient String-Matching Allowing for Non-Overlapping Inversions

Theoretical Computer Science, Elsevier, Vol. 843: pp.85-95
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2012

[11]

On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns

Journal of Discrete Algorithms, Vol.11: pp.25-36
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012

[10]

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach

Information and Computation, Vol. 213: pp. 3-12
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012

[9]

Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts

International Journal of Foundation of Computer Science, Vol. 23(2): pp. 343
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012

[8]

Pattern Matching with Swaps in Practice

International Journal of Foundation of Computer Science, Vol. 23(2): pp. 323
By Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012

[7]

String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)

Information Processing Letters, Volume 111 Issue 11, May, 2011
By Szymon Grabowski, Simone Faro and Emanuele Giaquinta
Published in 2011

[6]

New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps

International Journal of Foundation of Computer Science, Vol. 20(6): pp. 1087-1108
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2009

[5]

Efficient Variants of the Backward-Oracle-Matching Algorithm

International Journal of Foundation of Computer Science, Vol 20(6): pp. 967-984
By Simone Faro and Thierry Lecroq
Published in 2009

[4]

On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences

International Journal of Foundation of Computer Science, Vol. 19(1): pp. 103-124
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2008

[3]

A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem

International Journal of Foundation of Computer Science, Vol. 17(6): pp. 1235-1252
By Domenico Cantone and Simone Faro
Published in 2006

[2]

Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm

Journal of Automata, Languages and Combinatorics, Vol. 10(5/6): pp. 589-608
By Domenico Cantone and Simone Faro
Published in 2005

[1]

Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm

Electronic Notes in Discrete Mathematics, Volume 17, pp.81-86
By Domenico Cantone and Simone Faro
Published in 2004

 

Lista degli articoli pubblicati su conferenze internazionali

[46]

A Very Fast String Matching Algorithm Based on Condensed Alphabets

Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information and Management, AAIM 2016, to appear
By Simone Faro
Published in 2016

[45]

Efficient Algorithms for the Order Preserving Pattern Matching Problem

Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information and Management, AAIM 2016, to appear
By Simone Faro and Oguzhan Kulekci
Published in 2016

[44]

Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences

Proceedings of the 3rd Internanional Conference on Algorithms for Computational Biology, AlCOB 2016, to appear
By Simone Faro
Published in 2016

[43]

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem

Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.22-35
By Simone Faro, Oguzhan Kulekci and Domenico Cantone
Published in 2015

[42]

Refined Tagging of Complex Verbal Phrases for the Italian Language

Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.132-145
By Simone Faro and Arianna Pavone
Published in 2015

[41]

Prior Polarity Lexical Resources for the Italian Language

Proceedings of the 12th International Workshop on Natural Language Processing and Cognitive Science, to appear
By V. Borzì, S. Faro, A. Pavone and S. Sansone
Published in 2015

[40]

Short Read Alignment and Compression via Shortest Unique Substring Identi ers

Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering, LNCS Vol.9044, pp.363-374
By B.Adas, E.Bayraktar, S.Faro, I.E.Moustafa and M.O.Kulekci
Published in 2015

[39]

Automatic Extraction of Semantic Relations by Using Web Statistical Information

Proceedings of the International Conference on Conceptual Structures 2014 (ICCS 2014), pp.174-187
By Valeria Borzì, Simone Faro and Arianna Pavone
Published in 2014

[38]

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata

Proceedings of the Prague Stringology Conference 2014, PSC 2014, pp.30-42
By Simone Faro and Domenico Cantone
Published in 2014

[37]

Swap Matching in Strings by Simulating Reactive Automata

Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.7-20
By Simone Faro
Published in 2013

[36]

Towards a Very Fast Multiple String Matching Algorithm for Short Patterns

Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.78-91
By Simone Faro and Oguzhan Kulekci
Published in 2013

[35]

Improved and Self-Tuned Occurrence Heuristics

Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.92-106
By Simone Faro and Domenico Cantone
Published in 2013

[34]

Fast Packed String Matching for Short Patterns

Proceedings of the International Meeting on Algorithm Engineering and Experiments (ALENEX13), pp.113-121
By Simone Faro and Oguzhan Kulekci
Published in 2013

[33]

Fast Searching in Biological Sequences Using Multiple Hash Functions

Proceedings of the 12th IEEE International Conference on BioInformatics and BioEngineering (BIBE), pp. 175-180
By Simone Faro and Thierry Lecroq
Published in 2012

[32]

Fast Multiple String Matching Using Streaming SIMD Extensions Technology

Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE), Lecture Notes in Computer Science, 2012, Volume 7608, pp. 217-228
By Simone Faro and Oguzhan Kulekci
Published in 2012

[31]

A Fast Suffix Automata Based Algorithm for Exact Online String Matching

Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA), Lecture Notes in Computer Science, 2012, Volume 7381, pp. 149-158
By Simone Faro and Thierry Lecroq
Published in 2012

[30]

A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms

Proceedings of the 11-th International Symposium on Experimental Algorithms (SEA), Lecture Notes in Computer Science, 2012, Volume 7276/2012, pp.172-183
By Simone Faro and Thierry Lecroq
Published in 2012

[29]

2001–2010: Ten Years of Exact String Matching Algorithms

Proceedings of the Prague Stringology Conference 2011, PSC 2011, pp.1-2
By Simone Faro and Thierry Lecroq
Published in 2011

[28]

Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions

In Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, Lecture Notes in Computer Science, 2011, Volume 6661/2011, pp.364-375
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2011

[27]

Approximate String Matching Allowing for Inversions and Translocations

In J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.37-51
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2010

[26]

A Space-Efficient Implementation of the Good-Suffix Heuristic

In J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.63-75
By Domenico Cantone and Simone Faro
Published in 2010

[25]

A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach

In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Lecture Notes in Computer Science, 2010, Volume 6129/2010, pp. 288-298
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2010

[24]

Bit-(Parallelism)^2: Getting to the Next Level of Parallelism

In Proceedings of the Fifth International Conference on Fun With Algorithms, FUN 2010, Lecture Notes in Computer Science, 2010, Volume 6099/2010, pp.166-177
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2010

[23]

Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String Problem

In Proceedings of the 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Lecture Notes in Computer Science, Vol.5901 Springer Berlin, pp.370-381
By Simone Faro and Elisa Pappalardo
Published in 2010

[22]

Efficient Pattern Matching on Binary Strings

In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic
By Simone Faro and Thierry Lecroq
Published in 2009

[21]

Pattern Matching with Swaps for Short Patterns in Linear Time

In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic. Lecture Notes In Computer Science, Vol. 5404, Springer Berlin, pp.255-266
By Domenico Cantone and Simone Faro
Published in 2009

[20]

A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative Arcs

In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic
By Domenico Cantone and Simone Faro
Published in 2009

[19]

An efficient matching algorithm for encoded DNA sequences and binary strings

In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009). Lecture Notes In Computer Science, Vol. 5577, Springer-Verlag, pp.106-115
By Simone Faro and Thierry Lecroq
Published in 2009

[18]

A New Algorithm for Efficient Pattern Matching with Swaps

In Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Lecture Notes In Computer Science, Vol. 5874, Springer-Verlag, pp.230-241
By Matteo Campanelli, Domenico Cantone and Simone Faro
Published in 2009

[17]

An Efficient Algorithm for Approximate Pattern Matching with Swaps

In J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 90-104
By Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2009

[16]

Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts

In J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 29-39
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2009

[15]

Efficient Variants of the Backward-Oracle-Matching Algorithm

In J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 146-160
By Simone Faro and Thierry Lecroq
Published in 2008

[14]

New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps

In J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 170-184
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2008

[13]

Finite State Models for the Generation of Large Corpora of Natural Language Texts

In Proceedings of the Seventh International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP 2008), Ispra, Lago Maggiore
By Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta
Published in 2008

[12]

Pattern Matching for Control Chart Monitoring

In Progress in Industrial Mathematics at ECMI 2006, Mathematics in Industry, Volume 12, Springer Berlin Heidelberg, pp. 918-922
By Domenico Cantone and Simone Faro
Published in 2007

[11]

On some Combinatorial Problems concerning the Harmonic Structure of Musical Chord Sequences

In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '06, Czech Technical University, Prague, Czech Republic
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2006

[10]

An Efficient Algorithm for delta-Approximate-Matching with alpha-Bounded Gaps in Musical Sequences

In S.E. Nikoletseas (Ed.), Proc. of 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), Lecture Notes in Computer Science, Springer, Vol. 3503, pp. 428-439
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2005

[9]

On Tuning The (Delta,Alpha)-Sequential-Sampling Algorithm For Delta-Approximate Matching With Alpha-Bounded Gaps In Musical Sequences

In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2005

[8]

Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences

In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2005

[7]

A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem

In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '05, Czech Technical University, Prague, Czech Republic, pp. 109-124
By Domenico Cantone and Simone Faro
Published in 2005

[6]

Searching for a substring with constant extra space complexity

In P. Ferragina and R. Grossi (Eds.), Proc. Of the Third International Conference on FUN with Algorithms (FUN 2004), Edizioni Plus, University of Pisa, pp. 118-131
By Domenico Cantone and Simone Faro
Published in 2004

[5]

Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm

In Proc. of Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004)
By Domenico Cantone and Simone Faro
Published in 2004

[4]

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences

In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '04, Czech Technical University, Prague, Czech Republic, pp. 33-47
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2004

[3]

Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm

In K. Jansen, M. Margraf, M. Mastrolilli, J.D.P. Rolim (Eds.), Proc. Of Second International Workshop on Experimental Algorithms (WEA 2003), Lecture Notes in Computer Science, Springer, Vol. 2647, pp. 47-58
By Domenico Cantone and Simone Faro
Published in 2003

[2]

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm

In M. Simanek (Ed.) In Proc. of the Prague Stringology Conference '03, Czech Technical University, Prague, Czech Republic, pp. 10-24
By Domenico Cantone and Simone Faro
Published in 2003

[1]

On the Frequency of Characters in Natural Language Texts

In F. Spoto, G. Scollo, and A. Nijholt (Eds.), Proc. Of Algebraic Methods in Language Processing 2003, II AMAST Workshop On Language Processing, pp. 69-82
By Domenico Cantone and Simone Faro
Published in 2003

 

Interessi di ricerca:

  • Text and strings processing algorithms
  • Simulation of nondeterministic finite automata
  • Exact and approximate pattern matching
  • Multiple string matching
  • Data compression
  • Pattern matching on compressed texts
  • Combinatorial algorithms on graphs
  • Privacy preserving text processing

 

Partecipazione a convegni internazionali:

[25]

Prior Polarity Lexical Resources for the Italian Language
12th International Workshop on Natural Language Processing and Cognitive Science (NLPCS 2015)

Krakow, Poland
Given on September 22-24, 2015

[24]

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem
Prague Stringology Conference 2015

Prague, Czech Republic
Given on 24-26 August 2015

[23]

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata
Prague Stringology Conference 2014

Prague, Czech Republic
Given on 4-6 September 2014

[22]

Automatic Extraction of Semantic Relations by Using Web Statistical Information
21st International Conferences on Conceptual Structures (ICCS 2014)

Iasi, Romania
Given on 27 - 30 July 2014

[21]

Swap Matching in Strings by Simulating Reactive Automata
Prague Stringology Conference 2013

Prague, Czech Republic
Given on 2-4 September 2013

[20]

Fast Searching in Biological Sequences Using Multiple Hash Functions
IEEE 12th International Conference on BioInformatics and BioEngineering (BIBE'12)

Larnaca, Ciprus
Given on 11-13 November 2013

[19]

A Fast Suffix Automata Based Algorithm for Exact Online String Matching
17th International Conference on Implementation and Application of Automata (CIAA'12)

Porto, Portugal
Given on 17-20 July 2012

[18]

Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions
22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)

Palermo, Italy
Given on 27-29 June 2011

[17]

Compact Representations of Nondeterministic Automata for the Bit-Parallel Approach
London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2011

King's College, London, UK
Given on February 2011

[16]

Approximate String Matching Allowing for Inversions and Translocations
the Prague Stringology Conference 2010

Prague, Czech Republic
Given on Septempber 2010

[15]

A Space-Efficient Implementation of the Good-Suffix Heuristic
the Prague Stringology Conference 2010

Prague, Czech Republic
Given on September 2010

[14]

Bit-(Parallelism)^2: Getting to the Next Level of Parallelism
Fifth International Conference on Fun With Algorithms

Ischia, Italy
Given on June 2010

[13]

On the Bit-Parallel Simulation of the Nondeterministic Aho-Corasick Trie
London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2010

Ischia, Italy
Given on February 2010

[12]

Pattern Matching with Swaps for Short Patterns in Linear Time
35th International Conference on Current Trends in Theory and Practice of Computer Science

Spindleruv Mlyn, Czech Republic
Given on January 2009

[11]

A New Algorithm for Efficient Pattern Matching with Swaps
20th International Workshop on Combinatorial Algorithms

Hradec nad Moravicí, Czech Republic
Given on June 2009

[10]

Efficient Variants of the Backward-Oracle-Matching Algorithm
the 13th Prague Stringology Conference 2008

Prague, Czech Republic
Given on September 2008

[9]

New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps
the 13th Prague Stringology Conference 2008

Prague, Czech Republic
Given on September 2008

[8]

A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem
University of Rouen

Rouen, France
Given on September 2007

[7]

A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem
the Prague Stringology Conference 2005

Prague, Czech Republic
Given on September 2005

[6]

Searching for a substring with constant extra space complexity
Third International Conference on FUN with Algorithms

Elba Island, Itlay
Given on May 2004

[5]

Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm
Cologne-Twente Workshop on Graphs and Combinatorial Optimization

Milano, Itlay
Given on May 2004

[4]

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences
the Prague Stringology Conference 2004

Prague, Czech Republic
Given on September, 2004

[3]

Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm
Second International Workshop on Experimental Algorithms

Ascona, Switzerland
Given on May 2003

[2]

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm
the Prague Stringology Conference 2003

Prague, Czech Republic
Given on September 2003

[1]

On the Frequency of Characters in Natural Language Texts
II AMAST Workshop On Language Processing

Verona, Italy
Given on August 2003

 

 

Tutte le informazioni relative all'esame di Abilità Informatiche (Dipartimento di Scienze Umanistiche) possono essere reperite sul sito internt del corso, all'indirizzo: https://www.dmi.unict.it/~faro/infdisum/esami/abinform.php

Le risposte alle domande frquenti relative all'esame di Abilità Informatiche possono essere trovate all'indirizzo web: https://www.dmi.unict.it/~faro/infdisum/esami/faq.php 

DataStudenteArgomento della tesi
02/10/2017T35/000108La traduzione automatica
20/07/2017T35/000861Interazione uomo-macchina
29/05/2017T35/000906Wikipedia e la rete semantica
27/04/2017644/005837Intelligenza artificiale
21/03/2017T35/000638Sviluppo dell'interazione uomo-macchina
21/02/2017656/006416Storia dei videogames
15/12/2016T35/000917La digitalizzazione dei testi
30/11/2016T35/000578Introduzione al coding
14/09/2016644/004363Linguistica computazionale
14/09/2016644/003294L'intelligenza artificiale nel cinema
12/07/2016656/005486Internet e sicurezza: i minori e la trappola della rete
18/06/2015656/006461Citizen journalism: il giornalismo nell'era 2.0
20/11/2014644/007396Microsoft Office Communicator, da strumento di comunicazine interna a componente strategico della comunicazione organizzativa azienale world-wide
10/01/2014644/003323Sentiment analysis