SIAMCO
2000
14 years 9 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
76
Voted
CVIU
2006
14 years 9 months ago
2006
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
AUTOMATICA
2007
14 years 9 months ago
2007
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
73
Voted
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Although linear representations are frequently used in image analysis, their performances are seldom optimal in specific applications. This paper proposes a stochastic gradient al...