6315 search results - page 204 / 1263 » Approximating Solution Structure |
185
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
164
click to vote
AAIM
2010
Springer
15 years 10 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
151
click to vote
EWRL
2008
15 years 8 months ago
2008
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
186
click to vote
ACL
2006
15 years 8 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...