569 search results - page 73 / 114 » Online Bounds for Bayesian Algorithms |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we investigate a new machine learning framework called Online Transfer Learning (OTL) that aims to transfer knowledge from some source domain to an online learning ...
100
click to vote
UAI
2003
14 years 11 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
AIPS
2007
15 years 6 days ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...