2695 search results - page 229 / 539 » Learning Graph Matching |
158
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
171
click to vote
ERCIMDL
2010
Springer
15 years 4 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
111
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
112
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
194
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper deals with a new problem in face recognition
research, in which the enrollment and query face samples
are captured under different lighting conditions. In our
case, t...