2990 search results - page 358 / 598 » Hidden Markov processes |
170
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we describe an unsupervised segmentation method for contours which proves quite adapted for the images obtained by electronic acquisition. We present two statistica...
199
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
Unsupervised segmentation of weather images into features that correspond to physical storms is a fundamental and difficult problem. Treating an infrared satellite image as a Mark...
159
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
169
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
162
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...