Sciweavers

1957 search results - page 26 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
CSDA
2006
94views more  CSDA 2006»
14 years 9 months ago
Simulation-based approach to estimation of latent variable models
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
Zhiguang Qian, Alexander Shapiro
CP
2008
Springer
14 years 11 months ago
Approximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Pe...
SAT
2005
Springer
145views Hardware» more  SAT 2005»
15 years 3 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...