1142 search results - page 34 / 229 » Approximability of Clausal Constraints |
121
click to vote
NIPS
2008
15 years 3 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
147
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
142
click to vote
CORR
2011
Springer
14 years 9 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...
ARITH
2007
IEEE
15 years 8 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
154
click to vote
JMLR
2012
13 years 4 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...