244 search results - page 22 / 49 » Generalized RANSAC Framework for Relaxed Correspondence Prob... |
SIAMJO
2002
13 years 7 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
HIPC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...