1056 search results - page 90 / 212 » Constraint-Based Graph Matching |
COMBINATORICS
1998
13 years 8 months ago
1998
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
MST
2008
13 years 9 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
SIGMOD
2011
ACM
12 years 12 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
CVPR
2003
IEEE
14 years 11 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...