Sciweavers

1477 search results - page 195 / 296
» Complexity of (iterated) dominance
Sort
View
ICONIP
2009
14 years 10 months ago
Tracking in Reinforcement Learning
Reinforcement learning induces non-stationarity at several levels. Adaptation to non-stationary environments is of course a desired feature of a fair RL algorithm. Yet, even if the...
Matthieu Geist, Olivier Pietquin, Gabriel Fricout
99
Voted
ICIP
2010
IEEE
14 years 10 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 7 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
JDCTA
2010
272views more  JDCTA 2010»
14 years 7 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
TSP
2010
14 years 7 months ago
Adaptive precoding for downstream crosstalk precancelation in DSL systems using sign-error feedback
The performance of many very high bit rate digital subscriber line (VDSL) systems is limited by the effects of crosstalk among the wires in a bundle. For the downstream, a precoder...
Jérôme Louveaux, Alle-Jan van der Vee...