The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph. This note discusses the polynomial reconstructibility of the matching polynomial. We collect previous resul...

We study sequential bargaining in many-to-one matching markets. We show that there is an advantage to entering late in the market, and that the last agent to enter the market will receive his or her best partner in a stable matching, extending the results of Blum and Rothblum (2002) and Cechlárová (2002) for the marriage model. We also discuss the relation between sequential bargaining and a po...

Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation on this...

Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of FirstName, LastName to FullName on one end, to complex machings, such as parsing and pairing symbol/digit strings to SSN numbers, at the other...

Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when being applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation o...

The best known algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines ten variations of this algorithm in a search for improved performance, and concludes that the non-wildcard and hierarchical algorithms have red...

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic polyhedral results. For mixed graphs, the notion of matching forest was proposed as a common generalization matchings branchings. In this paper, we propose edge cover covering counterpart forest, extend matching–covering framework graphs. While result...

BACKGROUND AND OBJECTIVES There is a national shortage of primary care physicians; many medical school departments of family medicine are searching for new ways to attract and retain students who may be interested in primary care. In 2004, our department began a "pipeline" program targeted at entering first-year students that incorporates curricular, extracurricular, summer, and career-planning...

This paper presents a method of using Hough space for solving the correspondence problem in stereo vision. It is shown that the line-matching problem in image space can readily be converted into a point-matching problem in Hough (p-8) space. Dynamic programming can be used for searching the optimal matching, now in Hough space. The combination of multiple constraints, especially the natural emb...