Sciweavers

960 search results - page 57 / 192
» Optimal Monte Carlo Algorithms
Sort
View
AAAI
2012
11 years 10 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
ICPR
2002
IEEE
14 years 21 days ago
A Robust Algorithm for Probabilistic Human Recognition From
Human recognition from video requires solving the two tasks, recognition and tracking, simultaneously. This leads to a parameterized time series state space model, representing bo...
Shaohua Kevin Zhou, Rama Chellappa
ICASSP
2011
IEEE
12 years 11 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 4 months ago
Statistical based link insertion for robust clock network design
We present a statistical based non-tree clock distribution construction algorithm that starts with a tree and incrementally insert cross links, such that the skew variation of the...
Wai-Ching Douglas Lam, J. Jam, Cheng-Kok Koh, Venk...
ICPR
2010
IEEE
13 years 9 months ago
Learning Probabilistic Models of Contours
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
Laure Amate, Maria João Rendas