1176 search results - page 26 / 236 » Sparse reward processes |
114
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Assuming that a set of source signals is sparsely representable in a given dictionary, we show how their sparse recovery fails whenever we can only measure a convolved observation...
134
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
145
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization pro...
152
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
130
Voted
AAAI
1997
15 years 5 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...