2219 search results - page 220 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
148
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
GD
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
217
click to vote
WAE
2001
15 years 4 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
105
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
168
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...