226 search results - page 30 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
MDM
2009
Springer
14 years 2 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
FGR
2011
IEEE
12 years 11 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
JMLR
2010
13 years 2 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
CVPR
2008
IEEE
13 years 9 months ago
2008
IEEE
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...