Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
Two conciliation processes for intelligent agents based on an iterated mergethen-revise change function for belief profiles are introduced and studied. The first approach is ske...
This paper presents an automated tool for local, conformal refinement of all-hexahedral meshes based on the insertion of multidirectional twist planes into the spatial twist conti...
Nathan J. Harris, Steven E. Benzley, Steven J. Owe...
Translating documents from a source to a target language is a repetitive activity. The attempt to automate such a difficult task has been a long-term scientific dream. Among the...
Federica Mandreoli, Riccardo Martoglia, Paolo Tibe...