This paper studies Bayesian equilibrium in a worker firm matching problem in which workers choose their human capital investment and firms choose wages before the matching process occurs. Symmetric equilibrium exists, and supports assortative matching. When the number of traders is large, the highest types invest efficiently, while low types invest too much and receive wages that are too high i...

Images may be matched as whole images or using shape matching. Shape matching requires: identifying edges in the image, finding shapes using the edges and representing the shapes using a suitable metric. A Laplacian edge detector is simple and efficient for identifying the edges of shapes. Chain codes describe shapes using sequences of numbers and may be matched simply, accurately and flexibly....

Optimal binary codes for pixel values are designed for accurate block matching in the fast motion estimation. The conventional binary block matching techniques reduce the computational complexity and the memory bandwidth for the motion estimation, but they degrade the matching accuracy. We find the optimal mapping function between the set of decimal numbers for uniformly quantized pixel values ...

Based on the interval neutrosophic numbers, a new multi-objective optimal model of two-sided matching is researched. Through integrating interval neutrosophic information of each subject, the relative closeness degree of uncertainty evaluation information and positive and negative ideal is calculated by the approximate method, which can be expected as the satisfaction of the matching subjects. ...

A graph Γ1 is a matching minor of Γ if some even subdivision of Γ1 is isomorphic to a subgraph Γ2 of Γ, and by deleting the vertices of Γ2 from Γ the left subgraph has a perfect matching. Motivated by the study of Pfaffian graphs (the numbers of perfect matchings of these graphs can be computed in polynomial time), we characterized Abelian Cayley graphs which do not contain a K3,3 matching mino...

Peer-to-peer frameworks are known to be robust and scalable to large numbers of agents. Recent resource allocation studies have leveraged this by using peer-to-peer frameworks for the implementation of resource matching algorithms. In this paper, we present a matching protocol for multiagent resource allocation in a competitive peer-to-peer environment; this work marks the first solution to the...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of ...

The best known control algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm, popularized and extended by Grimson, Lozano-Perez, Huttenlocher and others. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines eleven variations of this algorithm in a search for improve...

We show how the level matching condition in six dimensional, abelian and supersymmetric orbifolds of the E8 × E8 heterotic string can be given equivalently in terms of fractional gauge and gravitational instanton numbers. This relation is used to restate the classification of the orbifolds in terms of flat bundles away from the orbifold singularities under the constraint of the level matching c...