307 search results - page 6 / 62 » The convex hull of ellipsoids |
DCG
2007
13 years 7 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
ESANN
2001
13 years 9 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...