3894 search results - page 62 / 779 » Approximation Algorithms for Biclustering Problems |
198
click to vote
IPCO
2008
15 years 7 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
170
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
143
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
166
click to vote
NIPS
2007
15 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
161
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...