Sciweavers

1176 search results - page 13 / 236
» Sparse reward processes
Sort
View
ACSD
2008
IEEE
107views Hardware» more  ACSD 2008»
15 years 1 months ago
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
Jasen Markovski, Erik P. de Vink
98
Voted
AMAI
2004
Springer
15 years 5 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
ICASSP
2010
IEEE
14 years 12 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro
ICASSP
2008
IEEE
15 years 6 months ago
A first step to convolutive sparse representation
In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted v...
Hamed Firouzi, Massoud Babaie-Zadeh, Aria Ghasemia...
ICA
2007
Springer
15 years 5 months ago
Dictionary Learning for L1-Exact Sparse Coding
We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, b...
Mark D. Plumbley