7129 search results - page 810 / 1426 » Approximation Algorithms for Treewidth |
168
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
145
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
198
Voted
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
173
Voted
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Spectrum sensing, which monitors the spectrum activity, is studied for cognitive radio systems using multiple frequency bands with non-negligible band switching time (blind per...
159
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...