2342 search results - page 121 / 469 » Sublinear geometric algorithms |
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
115
Voted
CGF
2005
15 years 21 days ago
2005
Level set models combine a low-level volumetric representation, the mathematics of deformable implicit surfaces, and powerful, robust numerical techniques to produce a novel appro...
96
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
126
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
101
click to vote
ECCV
2004
Springer
15 years 6 months ago
2004
Springer
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...