144 search results - page 6 / 29 » Improved Approximation Guarantees for Sublinear-Time Fourier... |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
MFCS
2009
Springer
13 years 12 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
CVIU
2008
13 years 7 months ago
2008
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
ORL
2007
13 years 6 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...