80 search results - page 5 / 16 » Learning non-stationary conditional probability distribution... |
133
Voted
NIPS
2008
15 years 3 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...
111
Voted
IJCV
1998
15 years 1 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
15 years 1 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, ...
100
click to vote
CORR
2010
Springer
15 years 1 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...
100
click to vote
ECML
2001
Springer
15 years 6 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...