the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

We propose an optimization approach to speed up the point matching process underlying the 3D reconstruction of complex urban scenes. We consider the Optical Flow technique for point matching and propose to introduce MMX and SSE2 instructions to accelerate significantly the matching process. Fast point matching allows using sub-pixel image resolution, which provides a more accurate estimation of...

Schema matching is considered as one of the essential phases of data integration in database systems. The main aim of the schema matching process is to identify the correlation between schema which helps later in the data integration process. The main issue concern of schema matching is how to support the merging decision by providing the correspondence between attributes through syntactic and ...

Although a number of different models have been suggested for the process that brings workers and firms together in the labour market, none of these performs well in empirical studies of the aggregate matching function. Empirically, the most successful functional form is Cobb-Douglas, for which there are no microfoundations in the existing literature. I present a new model for the matching proc...

This paper describes a new approach in color or grey-scale image matching by points of interest. As many point matching methods, this method is based on two main steps : computation of points and descriptors, followed by a matching process. The points of interest are extracted thanks to the color Harris points detector, they are then described using rotating anisotropic half-gaussian derivative...

Ontology matching is the process of finding semantic correspondences between entities from different ontologies. As an effective solution to linking different heterogeneous ontologies, ontology matching has attracted considerable attentions in recent years. In this paper, we propose a novel graphbased approach to ontology matching problem. Different from previous work, we formulate ontology mat...

Many use cases in business process management rely on the identification of correspondences between process models. However, the sparse information in process models makes matching a fundamentally hard problem. Consequently, existing approaches yield a matching quality which is too low to be useful in practice. Therefore we propose to investigate user feedback to improve the matching quality. T...

The performance of a fingerprint matching system is affected by the distortion introduced in the fingerprint impression during feature extraction process. This fingerprint features, such as ridge curves distorted in a complex manner. With the recent advancements in fingerprint sensing technology, many sensor devices to capture the fingerprint are now equipped with probability of dual resolution...