666 search results - page 112 / 134 » Unbalanced Graph Cuts |
CVPR
2006
IEEE
15 years 10 hour ago
2006
IEEE
Conventional video summarization methods focus predominantly on summarizing videos along the time axis, such as building a movie trailer. The resulting video trailer tends to reta...
ECCV
2006
Springer
14 years 12 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
ECCV
2006
Springer
14 years 12 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...