4843 search results - page 489 / 969 » The Shortcut Problem - Complexity and Approximation |
203
click to vote
TEC
2010
15 years 1 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
166
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
184
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
159
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
182
Voted
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...