Sciweavers

330 search results - page 11 / 66
» Algorithms for Propositional Model Counting
Sort
View
JAIR
2011
129views more  JAIR 2011»
14 years 6 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
COMPGEOM
2004
ACM
15 years 5 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
CC
2010
Springer
135views System Software» more  CC 2010»
14 years 11 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
IJCAI
2003
15 years 1 months ago
First-order probabilistic inference
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specificat...
David Poole
97
Voted
JSC
2006
102views more  JSC 2006»
14 years 11 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards