350 search results - page 26 / 70 » Lower and upper bounds on obtaining history independence |
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
We calculate the Shannon entropy rate of a binary Hidden Markov Process (HMP), of given transition rate and noise (emission), as a series expansion in . The first two orders are ca...
COMBINATORICA
2007
14 years 11 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
114
click to vote
MST
2011
14 years 6 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
UAI
2004
15 years 1 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...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...