224 search results - page 20 / 45 » Bounding Learning Time in XCS |
ACCV
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
CLOUDCOM
2010
Springer
13 years 6 months ago
2010
Springer
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...