Sciweavers

1722 search results - page 286 / 345
» Variables in Concept Graphs
Sort
View
COOPIS
2004
IEEE
15 years 7 months ago
Composing Mappings Between Schemas Using a Reference Ontology
Large-scale database integration requires a significant cost in developing a global schema and finding mappings between the global and local schemas. Developing the global schema r...
Eduard C. Dragut, Ramon Lawrence
BMCBI
2010
186views more  BMCBI 2010»
15 years 3 months ago
Knowledge-based biomedical word sense disambiguation: comparison of approaches
Background: Word sense disambiguation (WSD) algorithms attempt to select the proper sense of ambiguous terms in text. Resources like the UMLS provide a reference thesaurus to be u...
Antonio Jimeno Yepes, Alan R. Aronson
COR
2006
97views more  COR 2006»
15 years 3 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
SOSYM
2002
188views more  SOSYM 2002»
15 years 3 months ago
Extending the Unified Modeling Language for ontology development
Abstract. There is rapidly growing momentum for web enabled agents that reason about and dynamically integrate the appropriate knowledge and services at run-time. The dynamic integ...
Kenneth Baclawski, Mieczyslaw M. Kokar, Paul A. Ko...
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 4 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...