19 search results - page 1 / 4 » Sharper Upper and Lower Bounds for an Approximation Scheme f... |
CPM
2005
Springer
13 years 10 months ago
2005
Springer
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
COCO
1993
Springer
13 years 8 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
UAI
2004
13 years 6 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
NIPS
2004
13 years 6 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...