29 search results - page 2 / 6 » The Complete Analysis of the Binary Euclidean Algorithm |
CORR
2010
Springer
13 years 17 days ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
3DPVT
2006
IEEE
13 years 9 months ago
2006
IEEE
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
MICCAI
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
JUCS
2007
13 years 5 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
IMA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Software based side-channel attacks allow an unprivileged spy process to extract secret information from a victim (cryptosystem) process by exploiting some indirect leaka...