3250 search results - page 185 / 650 » Parameterized Learning Complexity |
187
click to vote
SAICSIT
2010
ACM
15 years 4 months ago
2010
ACM
Adaptive computer-based training systems aim to enhance the learning experience by personalising the presentation and content delivery according to the preferences of each particu...
184
click to vote
NN
2007
Springer
15 years 6 months ago
2007
Springer
Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
209
click to vote
ISNN
2004
Springer
15 years 12 months ago
2004
Springer
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
148
click to vote
ACL
1997
15 years 7 months ago
1997
This paper presents a method for the automatic extraction of subgrammars to control and speeding-up natural language generation NLG. The method is based on explanation-based learn...
158
click to vote
PAMI
2008
15 years 6 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...