736 search results - page 58 / 148 » Distinguishing geometric graphs |
107
click to vote
AGTIVE
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the subm...
111
click to vote
ER
1993
Springer
15 years 4 months ago
1993
Springer
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...
NIPS
1997
15 years 1 months ago
1997
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
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...