13 search results - page 2 / 3 » Approximate factorizations of distributions and the minimum ... |
COLT
1999
Springer
13 years 10 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
RECOMB
2003
Springer
14 years 6 months ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
TCOM
2011
13 years 21 days ago
2011
—Using high-rate theory approximations we introduce flexible practical quantizers based on possibly non-Gaussian models in both the constrained resolution (CR) and the constrain...
TIT
2002
13 years 5 months ago
2002
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...