3894 search results - page 418 / 779 » Approximation Algorithms for Biclustering Problems |
127
click to vote
ALGOSENSORS
2007
Springer
15 years 11 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
125
click to vote
ASPDAC
1999
ACM
15 years 9 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...
137
click to vote
CVPR
2004
IEEE
16 years 6 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...
132
click to vote
SODA
2003
ACM
15 years 6 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...
139
click to vote
IANDC
2006
15 years 4 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...