380 search results - page 9 / 76 » Instance Matching with COMA |
ENTCS
2006
13 years 7 months ago
2006
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
TCS
2008
13 years 7 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
DAM
2002
13 years 7 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...