1341 search results - page 187 / 269 » Probabilistic Abstraction Hierarchies |
157
click to vote
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...
169
click to vote
ACTA
2006
15 years 6 months ago
2006
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
178
click to vote
ENTCS
2006
15 years 6 months ago
2006
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...