740 search results - page 17 / 148 » An approximation ratio for biclustering |
121
Voted
IPL
2006
15 years 1 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
109
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
107
Voted
SIAMCOMP
2010
14 years 8 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
112
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
125
Voted
PPAM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...