285 search results - page 21 / 57 » Steaming on Convex Hulls |
3DPVT
2006
IEEE
14 years 3 months ago
2006
IEEE
Vanishing points are valuable in many vision tasks such as orientation estimation, pose recovery and 3D reconstruction from a single image. Many methods have been proposed to addr...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
CCCG
2006
13 years 11 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
IPL
2008
13 years 9 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
DAM
2007
13 years 9 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...