264 search results - page 36 / 53 » Learning Linearly Separable Languages |
DIS
2001
Springer
14 years 1 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
ECML
2006
Springer
14 years 8 days ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
COLT
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
COLT
2006
Springer
14 years 10 days ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
PRICAI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Humans can associate vision and language modalities and thus generate mental imagery, i.e. visual images, from linguistic input in an environment of unlimited inflowing i...