603 search results - page 50 / 121 » A General Approximation Technique for Constrained Forest Pro... |
117
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
109
click to vote
ECCC
2000
15 years 1 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
131
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
107
click to vote
ENTCS
2007
15 years 1 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
101
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...