2695 search results - page 81 / 539 » Learning Graph Matching |
137
Voted
PAMI
2006
15 years 2 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
133
click to vote
PPL
2008
15 years 2 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
194
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Density of moles is a strong predictor of malignant
melanoma. Some dermatologists advocate periodic fullbody
scan for high-risk patients. In current practice, physicians
compare...
116
click to vote
AMAI
2005
Springer
15 years 2 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
104
click to vote
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...