Sciweavers

1822 search results - page 143 / 365
» Risk-Sensitive Online Learning
Sort
View
NIPS
2008
13 years 9 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
HIS
2008
13 years 9 months ago
A Sequential Learning Resource Allocation Network for Image Processing Applications
Online adaptation is a key requirement for image processing applications when used in dynamic environments. In contrast to batch learning, where retraining is required each time a...
Stefan Wildermann, Jürgen Teich
NIPS
1997
13 years 9 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer
SIGGRAPH
2003
ACM
14 years 1 months ago
Forum: a new approach for the production of educational content
eLearning is developing at an ever increasing rate as universities and colleges recognize its vast potential to reach a deeper and fragmented student pool. For a while, eLearning ...
Christine Daviault, Marcelo Coelho
ICML
2006
IEEE
14 years 9 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman