Sciweavers

1261 search results - page 61 / 253
» Approximation algorithms for aligning points
Sort
View
CRV
2007
IEEE
224views Robotics» more  CRV 2007»
15 years 4 months ago
Real-time eye blink detection with GPU-based SIFT tracking
This paper reports on the implementation of a GPUbased, real-time eye blink detector on very low contrast images acquired under near-infrared illumination. This detector is part o...
Marc Lalonde, David Byrns, Langis Gagnon, Normand ...
CGF
2010
111views more  CGF 2010»
14 years 9 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
MP
2002
176views more  MP 2002»
14 years 9 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
14 years 11 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson
COMPGEOM
2004
ACM
15 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen