2219 search results - page 15 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
CVPR
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
ITICSE
2006
ACM
14 years 1 months ago
2006
ACM
In a small computer science department without a graduate program, it is sometimes difficult to attract research students. This is particularly true for research in computer visio...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
GI
2007
Springer
13 years 11 months ago
2007
Springer
: The aim of this paper is to present a modelling of rowing dynamics using bond graphs and to replace it by a modelling of mixed reality rowing dynamics using Mixed Reality Bond Gr...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...