Sciweavers

7015 search results - page 151 / 1403
» Approximation algorithms for co-clustering
Sort
View
ICASSP
2010
IEEE
13 years 9 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
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 10 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
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 11 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
SIAMCO
2000
117views more  SIAMCO 2000»
13 years 9 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
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...