Sciweavers

7129 search results - page 170 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICASSP
2010
IEEE
15 years 3 months ago
Multiple Selection Approximation for improved spatio-temporal prediction in video coding
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
Jürgen Seiler, André Kaup
111
Voted
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 3 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
148
Voted
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 4 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
114
Voted
SIAMCO
2000
117views more  SIAMCO 2000»
15 years 3 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
118
Voted
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 8 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...