Sciweavers

192 search results - page 22 / 39
» Boosting in Probabilistic Neural Networks
Sort
View
ATAL
2008
Springer
13 years 10 months ago
An approach to online optimization of heuristic coordination algorithms
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
Jumpol Polvichai, Paul Scerri, Michael Lewis
ICANN
2001
Springer
14 years 1 months ago
Sparse Kernel Regressors
Sparse kernel regressors have become popular by applying the support vector method to regression problems. Although this approach has been shown to exhibit excellent generalization...
Volker Roth
EMNLP
2006
13 years 10 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
ICPR
2002
IEEE
14 years 9 months ago
QuickStroke: An Incremental On-Line Chinese Handwriting Recognition System
This paper presents QuickStroke: a system for the incremental recognition of handwritten Chinese characters. Only a few strokes of an ideogram need to be entered in order for a ch...
Nada P. Matic, John C. Platt, Tony Wang
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 27 days ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani