( en | de | ru )

 

Disambiguation of "Mauro, Nicola Di"

Author of the publication

copydeleteadd this publication to your clipboard
Automatic Annotation of Historical Paper Documents.

, , , , , and . Intelligenza Artificiale, 1 (1): 44-49 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexandra Di Mauro

Mauro Nicola Perseghini

Christian Mauro

Frank Mauroschat

Jacopo Mauro

 

Other publications of authors with the same name

Simplifying, Regularizing and Strengthening Sum-Product Network Structure Learning., , and . ECML/PKDD (2), volume 9285 of Lecture Notes in Computer Science, page 343-358. Springer, (2015)Applying the information bottleneck to statistical relational learning., and . Mach. Learn., 86 (1): 89-114 (2012)Mining Time-series Sequences of Reactions for Biologically Active Patterns in Metabolic Pathways., , , , and . SEBD, page 40-51. (2007)Towards Automatic Digital Library Content-based Management., , , and . IRCDL, page 49-50. DELOS: a Network of Excellence on Digital Libraries, (2006)Sum-Product Networks for Hybrid Domains., , , , , and . CoRR, (2017)Italian Machine Learning and Data Mining research: The last years., , , , , , , , , and 8 other author(s). Intelligenza Artificiale, 7 (2): 77-89 (2013)Multi-Channel Deep Feature Learning for Intrusion Detection., , , , and . IEEE Access, (2020)A Hybrid Symbolic-Statistical Approach to Modeling Metabolic Networks., , , and . KES (1), volume 4692 of Lecture Notes in Computer Science, page 132-139. Springer, (2007)Multistrategy Learning of Rules for Automated Classification of Cultural Heritage Material., , , , , and . ICADL, volume 2555 of Lecture Notes in Computer Science, page 182-193. Springer, (2002)Theta-Subsumption and Resolution: A New Algorithm., , , and . ISMIS, volume 2871 of Lecture Notes in Computer Science, page 384-391. Springer, (2003)