✦ LIBER ✦

A Bayesian compatibility model for graph matching

✍ Scribed by Richard C. Wilson; Edwin R. Hancock

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 991 KB
Volume: 17
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(95)00115-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Bayesian decision model for cost optim

A Bayesian decision model for cost optimal record matching

✍ V.S. Verykios; G.V. Moustakides; M.G. Elfeky 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

Incentive compatibility for the stable m

Incentive compatibility for the stable matching model with an entrance criterion

✍ Nitsan Perach; Uriel G. Rothblum 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 158 KB

A matching algorithm for regular biparti

A matching algorithm for regular bipartite graphs

✍ J. Csima; L. Lovász 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Flexible and Robust Model Matching based

Flexible and Robust Model Matching based on Association Graph for Form Image Understanding

✍ Y. Ishitani 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 536 KB

Convergence of a hill-climbing genetic a

Convergence of a hill-climbing genetic algorithm for graph matching

✍ Andrew D.J. Cross; Richard Myers; Edwin R. Hancock 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 793 KB

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorp

Bipartite graph matching for points on a

Bipartite graph matching for points on a line or a circle

✍ Michael Werman; Shmuel Peleg; Robert Melter; T.Y Kong 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 376 KB