68 search results - page 10 / 14 » On the Complexity of Probabilistic Inference in Singly Conne... |
JAIR
2010
13 years 5 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
TNN
1998
13 years 7 months ago
1998
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
LPNMR
2005
Springer
14 years 26 days ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...