204 search results - page 14 / 41 » A Half-Million Strong at Least |
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
64
Voted
CAGD
2010
14 years 9 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
126
Voted
ICCV
2005
IEEE
2005
IEEE
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
15 years 11 months ago
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
ASWEC
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper explains some analyses that can be performed on a hierarchical finite state machine to validate that it performs as intended. Such a hierarchical state machine has tra...