1099 search results - page 96 / 220 » String Transformation Learning |
98
Voted
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
112
Voted
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
113
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
92
Voted
COGSCI
2004
15 years 20 days ago
2004
In the present study, using event-related functional magnetic resonance imaging, we investigated a group of participants on a grammaticality classification task after they had bee...
124
Voted
ICDAR
2011
IEEE
14 years 12 days ago
2011
IEEE
—This paper describes effective object function design for combining on-line and off-line character recognizers for on-line handwritten Japanese text recognition. We combine on-l...