3894 search results - page 160 / 779 » Approximation Algorithms for Biclustering Problems |
322
click to vote
IACR
2011
14 years 6 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
201
click to vote
SIAMJO
2011
15 years 25 days ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
153
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
175
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
183
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...