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 ...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
H. Sundar, Deborah Silver, Nikhil Gagvani, Sven J....
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...