9 search results - page 2 / 2 » Near-Linear Time Construction of Sparse Neighborhood Covers |
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
PODC
2005
ACM
13 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....