359 search results - page 21 / 72 » Solving Geometric Covering Problems by Data Reduction |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
SAC
2010
ACM
13 years 6 months ago
2010
ACM
Problems involving high-dimensional data, such as pattern recognition, image analysis, and gene clustering, often require a preliminary step of dimension reduction before or durin...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Distance metric learning and nonlinear dimensionality reduction are two interesting and active topics in recent years. However, the connection between them is not thoroughly studi...