We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
We propose a method to estimate dense motion vector fields from multi-exposure images. Our approach relies on finding a sparse set of correspondences between features in a single-...
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
: We introduce a class of quasi-linear models for stochastic dynamics, called moment-linear stochastic systems (MLSS). We formulate MLSS and analyze their dynamics, as well as disc...
Sandip Roy, George C. Verghese, Bernard C. Lesieut...
This paper contrasts three related regularization schemes for kernel machines using a least squares criterion, namely Tikhonov and Ivanov regularization and Morozov's discrepa...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...