2914 search results - page 258 / 583 » Learning and Inference with Constraints |
196
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
160
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
189
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
163
click to vote
EUROGP
2009
Springer
16 years 1 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
181
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...