1857 search results - page 92 / 372 » Minimum Degree Orderings |
140
click to vote
DM
2002
15 years 6 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
187
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Feature points for image correspondence are often selected according to subjective criteria (e.g. edge density, nostrils). In this paper, we present a general, non-subjective crit...
190
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
196
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
190
click to vote
3DIM
2005
IEEE
16 years 14 days ago
2005
IEEE
Iterative Closest Point (ICP) -based tracking works well when the interframe motion is within the ICP minimum well space. For large interframe motions resulting from a limited sen...