1341 search results - page 187 / 269 » Probabilistic Abstraction Hierarchies |
91
Voted
ECAI
2010
Springer
15 years 24 days 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 ...
93
Voted
CORR
2010
Springer
15 years 22 days 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...
104
Voted
CORR
2008
Springer
15 years 21 days 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...
100
Voted
ACTA
2006
15 years 21 days 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...
113
Voted
ENTCS
2006
15 years 19 days 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...