Sciweavers

380 search results - page 4 / 76
» Instance Matching with COMA
Sort
View
ORL
2008
99views more  ORL 2008»
13 years 7 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ESWS
2005
Springer
14 years 1 months ago
Web Explanations for Semantic Heterogeneity Discovery
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....
Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro ...
ESWS
2008
Springer
13 years 9 months ago
Handling Instance Coreferencing in the KnoFuss Architecture
Finding RDF individuals that refer to the same real-world entities but have different URIs is necessary for the efficient use of data across sources. The requirements for such inst...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
COOPIS
2004
IEEE
13 years 11 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
CVPR
2011
IEEE
13 years 3 months ago
2D Nonrigid Partial Shape Matching Using MCMC and Contour Subdivision
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...
Y. Cao, Z. Zhang, I. Czogiel, I. Dryden, S. Wang