821 search results - page 39 / 165 » Addressing the Petersen graph |
152
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
176
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
120
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...