4894 search results - page 711 / 979 » The Guarding Problem - Complexity and Approximation |
IJCV
1998
13 years 8 months ago
1998
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
ML
2002
ACM
13 years 8 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
ML
2002
ACM
13 years 8 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
KBS
1998
13 years 8 months ago
1998
This paper presents a hierarchical case representation using a context guided retrieval method. The performance of this method is compared to that of a simpler flat file represe...
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
13 years 8 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...