Sciweavers

61 search results - page 7 / 13
» Sample Complexity of Composite Likelihood
Sort
View
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 1 months ago
Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes
In this article, a new method for performance evaluation of Turbo-like codes is presented. This is based on estimating the Probability Density Function (pdf) of the bit Log-Likelih...
Ali Abedi, Mary E. Thompson, Amir K. Khandani
BMCBI
2006
86views more  BMCBI 2006»
13 years 7 months ago
Microbial identification by mass cataloging
Background: The public availability of over 180,000 bacterial 16S ribosomal RNA (rRNA) sequences has facilitated microbial identification and classification using hybridization an...
Zhengdong Zhang, George W. Jackson, George E. Fox,...
NN
2010
Springer
125views Neural Networks» more  NN 2010»
13 years 5 months ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
ECCV
2000
Springer
14 years 9 months ago
Stochastic Tracking of 3D Human Figures Using 2D Image Motion
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...
Hedvig Sidenbladh, Michael J. Black, David J. Flee...
ECAI
2008
Springer
13 years 9 months ago
Structure Learning of Markov Logic Networks through Iterated Local Search
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
Marenglen Biba, Stefano Ferilli, Floriana Esposito