3874 search results - page 410 / 775 » Approximation Algorithms for k-hurdle Problems |
189
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
155
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
166
Voted
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...
168
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
164
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...