54 search results - page 4 / 11 » uai 2003 |
UAI
2003
13 years 7 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
UAI
2003
13 years 7 months ago
2003
Despite its simplicity, the naive Bayes classifier has surprised machine learning researchers by exhibiting good performance on a variety of learning problems. Encouraged by thes...
UAI
2003
13 years 7 months ago
2003
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
UAI
2003
13 years 7 months ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
UAI
2003
13 years 7 months ago
2003
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...