Finite horizon sequential decision problems with a "temporal von Neumann-Morgenstern utility" criterion are analyzed. This criterion, as developed in [7], is a generalization of von ...

We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is ...