13784 search results - page 2250 / 2757 » On Computing Functions with Uncertainty |
203
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
208
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic princip...
189
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
166
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
194
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...