Sciweavers

530 search results - page 6 / 106
» Bounds on marginal probability distributions
Sort
View
TEC
2010
173views more  TEC 2010»
13 years 2 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
COLT
2008
Springer
13 years 9 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 7 months ago
Distance distribution of binary codes and the error probability of decoding
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
Alexander Barg, Andrew McGregor
GLOBECOM
2009
IEEE
13 years 5 months ago
Exact Closed-Form Expressions for the Outage Probability and Ergodic Capacity of Decode-and-Forward Opportunistic Relaying
Exact statistics of the local signal-to-noise ratios (SNRs) of the best relay in decode-and-forward (DF) opportunistic relaying (ORe) are derived. It is observed that although the ...
Reza Nikjah, Norman C. Beaulieu
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 8 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah