4007 search results - page 178 / 802 » Computation with imprecise probabilities |
123
click to vote
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
120
click to vote
EUROGP
2008
Springer
15 years 5 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
159
Voted
UAI
2001
15 years 5 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
122
Voted
IMAGING
2000
15 years 5 months ago
2000
In this paper we present a comprehensive method for identifying probable shadow regions in an image. Doing so is relevant to computer vision, colour constancy, and image reproduct...
107
click to vote
TWC
2008
15 years 3 months ago
2008
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...