67 search results - page 3 / 14 » S-Match: an Algorithm and an Implementation of Semantic Matc... |
132
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements. WS-Agre...
124
Voted
OTM
2005
Springer
15 years 9 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
141
Voted
IBIS
2006
15 years 3 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
122
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
114
Voted
ICWS
2010
IEEE
15 years 1 months ago
2010
IEEE
WS-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight ap...