1883 search results - page 12 / 377 » Ordered theta graphs |
136
click to vote
COMBINATORICS
2006
15 years 5 months ago
2006
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
157
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
174
click to vote
CVPR
2010
IEEE
16 years 1 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...
180
click to vote
CVPR
2009
IEEE
17 years 24 days ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
223
click to vote
CVPR
2009
IEEE
17 years 27 days ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...