Sciweavers

5785 search results - page 100 / 1157
» Approximability of Probability Distributions
Sort
View
123
Voted
JSAC
2008
87views more  JSAC 2008»
15 years 3 months ago
A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA
In this paper, a theoretical framework of divergence minimization (DM) is applied to derive iterative receiver algorithms for coded CDMA systems. The DM receiver obtained performs ...
Bin Hu, Ingmar Land, Lars K. Rasmussen, Romain Pit...
DAS
2008
Springer
15 years 5 months ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
IJCNN
2000
IEEE
15 years 7 months ago
On MCMC Sampling in Bayesian MLP Neural Networks
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
Aki Vehtari, Simo Särkkä, Jouko Lampinen
116
Voted
3DPVT
2006
IEEE
139views Visualization» more  3DPVT 2006»
15 years 9 months ago
A Probabilistic Notion of Correspondence and the Epipolar Constraint
We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being rob...
Justin Domke, Yiannis Aloimonos
123
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 3 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson