6020 search results - page 15 / 1204 » A New Approach to Model Counting |
AAAI
2008
15 years 2 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
121
click to vote
ACTA
2007
14 years 11 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
122
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
104
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...
203
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...