2219 search results - page 139 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
132
Voted
AI
1999
Springer
15 years 2 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
118
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
127
click to vote
ECCV
2004
Springer
16 years 4 months ago
2004
Springer
Abstract. We address the problem of modeling the spatial and temporal second-order statistics of video sequences that exhibit both spatial and temporal regularity, intended in a st...
100
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Many studies have now shown that it is possible to recognize people by the way they walk. As yet there has been little formal study of people recognition using the kinematic-relat...
96
Voted
ICPR
2010
IEEE
15 years 14 days ago
2010
IEEE
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a...