1389 search results - page 248 / 278 » Improved Approximation Algorithms for Label Cover Problems |
EUROCAST
2007
Springer
15 years 4 months ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
JMLR
2008
14 years 9 months ago
2008
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
118
click to vote
SIAMSC
2011
14 years 4 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...