Ontology matching has emerged as a crucial step when information sources are being integrated. Hence, ontology matching has attracted considerable attention in both academia and industry. Clearly, as information sources grow rapidly, manual ontology matching becomes tedious, time-consuming and leads to errors and frustration. Thus the need for automated and semi-automated approaches becomes inc...

We extend recent results using curve simplification for approximating the Fréchet distance of realistic curves in near linear time to map matching: the problem of matching a curve in an embedded graph. We show that the theoretical bounds on the running time of the previous result still hold if only one of the curves is simplified during the course of the approximation algorithm. This enables ou...

3 A framework for defining a schema matching problem 6 3.1 Modeling XML schemas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.1 Features of the XML schema language . . . . . . . . . . . . . . . . . . . . . 7 3.1.2 Graph theory basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.3 XML schema graph . . . . . . . . . . . . . . . . . . . . . . . . . ...

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

In this paper, we propose a new algorithm for automated image registration or precise correction of satellite images. We assume that ground control points used previously are stored within the system. The algorithm first applies matching between the GCP chips stored and a new image to be registered and creates new control points. An automated stereo matching based on normalized cross correlatio...