Back to Results
First PageMeta Content
Clique / Chordal graph / Line graph / Matching / Markov random field / Graphical model / Graph coloring / Clique problem / Graph theory / Graph operations / Tree decomposition


An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2
Add to Reading List

Document Date: 2008-05-10 06:35:04

Open Document

File Size: 249,66 KB

Share Result on Facebook

City

Edmonton / River / New York / Porto Alegre / /

Company

Oxford University Press / X5 / /

Country

Jordan / Brazil / Canada / /

/

Facility

Prentice Hall / University of Alberta / /

Holiday

Christmas / /

IndustryTerm

deterministic algorithms / polynomial time algorithms / element-by-element product / deterministic search / probabilistic networks / /

NaturalFeature

Fujiyama / /

Organization

Brazil CP / Oxford University / Department of Computing Science / University of Alberta / /

/

Position

probabilistic graphical model for point set matching / correspondent / representative / /

ProvinceOrState

Alberta / New Jersey / New York / /

Technology

Graduated Assignment Algorithm / electrophoresis / Junction Tree algorithm / HUGIN algorithm / following protocol / polynomial time algorithms / /

SocialTag