2219 search results - page 146 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
135
click to vote
CCCG
2003
15 years 4 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
141
Voted
MDM
2009
Springer
15 years 9 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
111
Voted
KBSE
2005
IEEE
15 years 8 months ago
2005
IEEE
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
138
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
129
click to vote
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...