1857 search results - page 62 / 372 » Minimum Degree Orderings |
PAMI
2006
13 years 10 months ago
2006
We contrast the performance of two methods of imposing constraints during the tracking of articulated objects, the first method preimposing the kinematic constraints during trackin...
COMBINATORICS
1999
13 years 10 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
CVPR
2008
IEEE
15 years 25 days ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
JAL
2006
13 years 10 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
PADS
2004
ACM
14 years 4 months ago
2004
ACM
This paper advocates the use of a formal framework for analyzing simulation performance. Simulation performance is characterized based on the three simulation development process ...