630 search results - page 25 / 126 » Hardness results for approximating the bandwidth |
107
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
88
Voted
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
132
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
108
click to vote
STOC
2006
ACM
16 years 24 days ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...