80 search results - page 5 / 16 » Learning non-stationary conditional probability distribution... |
NIPS
2008
13 years 11 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
IJCV
1998
13 years 9 months ago
1998
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot repre...
ADHOC
2004
13 years 9 months ago
2004
An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
ECML
2001
Springer
14 years 2 months ago
2001
Springer
Labeled data for classification could often be obtained by sampling that restricts or favors choice of certain classes. A classifier trained using such data will be biased, resulti...