1552 search results - page 36 / 311 » On the Complexity of Constant Propagation |
114
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
122
Voted
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
159
click to vote
META
1992
15 years 6 months ago
1992
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
135
click to vote
JMLR
2011
14 years 9 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
112
click to vote
WDAG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...