159 search results - page 8 / 32 » Incremental One-Class Learning with Bounded Computational Co... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
We extend a recent Sparse Representation-based Classification (SRC) algorithm for face recognition to work on 2D images directly, aiming to reduce the computational complexity whil...
ICPR
2000
IEEE
13 years 12 months ago
2000
IEEE
Many realistic visual recognition tasks are “open” in the sense that the number and nature of the categories to be learned are not initially known, and there is no closed set ...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
An original Reinforcement Learning (RL) methodology is proposed for the design of multi-agent systems. In the realistic setting of situated agents with local perception, the task o...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...