1080 search results - page 77 / 216 » The Complexity of Belief Update |
220
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
216
click to vote
AAAI
2011
14 years 6 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
132
click to vote
ICC
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
165
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
141
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...