142 search results - page 2 / 29 » On a Class of Diffeomorphic Matching Problems in One Dimensi... |
SIAMNUM
2010
13 years 3 days ago
2010
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
EOR
2007
13 years 5 months ago
2007
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...