Sciweavers

69 search results - page 8 / 14
» Random Sampling of States in Dynamic Programming
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Memory-based particle filter for face pose tracking robust under complex dynamics
A novel particle filter, the Memory-based Particle Filter (M-PF), is proposed that can visually track moving objects that have complex dynamics. We aim to realize robustness aga...
Dan Mikami (NTT), Kazuhiro Otsuka (NTT), Junji YAM...
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 12 days ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 2 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
ASPLOS
2012
ACM
12 years 3 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...