7006 search results - page 144 / 1402 » Approximation Algorithms |
100
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
118
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
100
Voted
NIPS
2003
15 years 4 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
137
Voted
FSTTCS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
129
Voted
FOCS
2010
IEEE
15 years 22 days ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give: