Sciweavers

1712 search results - page 141 / 343
» A Computational Approach to Binding Theory
Sort
View
139
Voted
SUM
2007
Springer
15 years 7 months ago
Combining Uncertain Outputs from Multiple Ontology Matchers
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
Ying Wang, Weiru Liu, David A. Bell
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 5 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
FMCAD
2006
Springer
15 years 5 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi
GISCIENCE
2010
Springer
190views GIS» more  GISCIENCE 2010»
15 years 2 months ago
Semantic Referencing - Determining Context Weights for Similarity Measurement
Semantic similarity measurement is a key methodology in various domains ranging from cognitive science to geographic information retrieval on the Web. Meaningful notions of similar...
Krzysztof Janowicz, Benjamin Adams, Martin Raubal
NORDICHI
2006
ACM
15 years 7 months ago
Understanding the work of an HCI practitioner
Users should be involved in the development of information technology (IT) artifacts. However, this is challenging, especially in product development context, in which Human Compu...
Netta Iivari