Sciweavers

508 search results - page 62 / 102
» Learning for stochastic dynamic programming
Sort
View
NIPS
2008
15 years 3 months ago
The Infinite Factorial Hidden Markov Model
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani
TMC
2010
139views more  TMC 2010»
15 years 10 days ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 9 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
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 1 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
IJCAI
2007
15 years 3 months ago
Learning to Walk through Imitation
Programming a humanoid robot to walk is a challenging problem in robotics. Traditional approaches rely heavily on prior knowledge of the robot's physical parameters to devise...
Rawichote Chalodhorn, David B. Grimes, Keith Groch...