7006 search results - page 477 / 1402 » Approximation Algorithms |
158
click to vote
SIAMJO
2008
15 years 6 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
172
click to vote
NCA
2007
IEEE
15 years 5 months ago
2007
IEEE
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
162
Voted
SIAMJO
2010
15 years 1 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
158
Voted
FOCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
239
click to vote
COCOON
2010
Springer
15 years 4 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...