Sciweavers

925 search results - page 90 / 185
» Probabilistic Belief Logics
Sort
View
AAAI
2008
13 years 10 months ago
Loop Calculus for Satisfiability
Loop Calculus, introduced by Chertkov and Chernyak, is a new technique to incrementally improve approximations computed by Loopy Belief Propagation (LBP), with the ability to even...
Lukas Kroc, Michael Chertkov
EMNLP
2007
13 years 9 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
TSMC
2008
122views more  TSMC 2008»
13 years 8 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin
CISS
2010
IEEE
12 years 11 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 8 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul