2020 - ACM Senior Member
His primary scientific interests are in Suffix array, Suffix tree, Algorithm, Search engine indexing and Combinatorics. His Suffix array research is multidisciplinary, incorporating elements of FM-index and Compressed suffix array. FM-index is a subfield of Data structure that he investigates.
While the research belongs to areas of Compressed suffix array, he spends his time largely on the problem of Generalized suffix tree, intersecting his research to questions surrounding Longest common substring problem and Theoretical computer science. The study incorporates disciplines such as Time complexity and Substring in addition to Suffix tree. His Search engine indexing study results in a more complete grasp of Information retrieval.
Paolo Ferragina mainly focuses on Algorithm, Theoretical computer science, Data structure, Information retrieval and Search engine indexing. The Algorithm study combines topics in areas such as Suffix array, FM-index and Substring. As a part of the same scientific family, Paolo Ferragina mostly works in the field of Suffix array, focusing on Generalized suffix tree and, on occasion, Longest common substring problem.
His studies deal with areas such as Tree, String and Compressed suffix array as well as Theoretical computer science. The various areas that Paolo Ferragina examines in his Data structure study include Parallel algorithm, Auxiliary memory, Set and Cache. Paolo Ferragina combines subjects such as Annotation, Ranking, Entity linking and Cluster analysis with his study of Information retrieval.
The scientist’s investigation covers issues in Information retrieval, Artificial intelligence, Search engine indexing, Data structure and Entity linking. His work on Web search engine as part of general Information retrieval research is often related to Noise, thus linking different fields of science. His Artificial intelligence study combines topics from a wide range of disciplines, such as Machine learning, Rank, Pattern recognition and Natural language processing.
The concepts of his Data structure study are interwoven with issues in Exploit, Theoretical computer science and Data mining. His Theoretical computer science study combines topics in areas such as Complement and Heuristics. In his research on the topic of Entity linking, Semantic search, Semantic similarity, Profiling, Crowdsourcing and PageRank is strongly related with Graph.
His main research concerns Data structure, Search engine indexing, Information retrieval, Entity linking and Theoretical computer science. His work deals with themes such as Exploit and Trait, which intersect with Data structure. His Search engine indexing study incorporates themes from Field, Semantic similarity, Heuristics, Complement and Profiling.
His Information retrieval research includes themes of Graph and Task. His Entity linking research integrates issues from Coherence and Web search engine. His work carried out in the field of Theoretical computer science brings together such families of science as Distribution and Orders of magnitude.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Opportunistic data structures with applications
P. Ferragina;G. Manzini.
foundations of computer science (2000)
Opportunistic data structures with applications
P. Ferragina;G. Manzini.
foundations of computer science (2000)
TAGME: on-the-fly annotation of short text fragments (by wikipedia entities)
Paolo Ferragina;Ugo Scaiella.
conference on information and knowledge management (2010)
TAGME: on-the-fly annotation of short text fragments (by wikipedia entities)
Paolo Ferragina;Ugo Scaiella.
conference on information and knowledge management (2010)
Indexing compressed text
Paolo Ferragina;Giovanni Manzini.
Journal of the ACM (2005)
Indexing compressed text
Paolo Ferragina;Giovanni Manzini.
Journal of the ACM (2005)
The string B-tree: a new data structure for string search in external memory and its applications
Paolo Ferragina;Roberto Grossi.
Journal of the ACM (1999)
The string B-tree: a new data structure for string search in external memory and its applications
Paolo Ferragina;Roberto Grossi.
Journal of the ACM (1999)
Optical recognition of motor vehicle license plates
P. Comelli;P. Ferragina;M.N. Granieri;F. Stabile.
IEEE Transactions on Vehicular Technology (1995)
Optical recognition of motor vehicle license plates
P. Comelli;P. Ferragina;M.N. Granieri;F. Stabile.
IEEE Transactions on Vehicular Technology (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Eastern Piedmont Amadeo Avogadro
Rutgers, The State University of New Jersey
University of Pisa
RMIT University
Institute of Information Science and Technologies
Universita della Svizzera Italiana
Google (United States)
Dalhousie University
University of Chile
Max Planck Institute for Informatics
Citizens Financial Group
ALL WIRELESS CONSULTANCY LLC
Harvard University
Rutherford Appleton Laboratory
Donghua University
NorthShore University HealthSystem
Martin Luther University Halle-Wittenberg
University of California, Santa Barbara
Forschungszentrum Jülich
University of Edinburgh
United Way
French Research Institute for Exploitation of the Sea
Johns Hopkins University
Animal and Plant Health Inspection Service
Brunel University London
Holland Bloorview Kids Rehabilitation Hospital