1897 search results - page 219 / 380 » Sparse Additive Machine |
176
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
155
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...
181
click to vote
EACL
2009
ACL Anthology
16 years 6 months ago
2009
ACL Anthology
Spoken Language Understanding aims at mapping a natural language spoken sentence into a semantic representation. In the last decade two main approaches have been pursued: generati...
162
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...
169
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...