Sciweavers

2031 search results - page 53 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
COOPIS
2004
IEEE
15 years 10 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
CLEF
2006
Springer
15 years 10 months ago
Paraphrase Substitution for Recognizing Textual Entailment
We describe a method for recognizing textual entailment that uses the length of the longest common subsequence (LCS) between two texts as its decision criterion. Rather than requi...
Wauter Bosma, Chris Callison-Burch
ICIP
1995
IEEE
15 years 9 months ago
Fast image search using a multiscale stochastic model
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...
S. Sista, Charles A. Bouman, Jan P. Allebach
CVPR
2011
IEEE
14 years 10 months ago
Shape Based Pedestrian Parsing
We describe a simple model for parsing pedestrians based on shape. Our model assembles candidate parts from an oversegmentation of the image and matches them to a library of exemp...
Yihang Bo, Charless Fowlkes
SUM
2007
Springer
16 years 9 days 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