895 search results - page 11 / 179 » Approximate convex decomposition |
147
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
181
click to vote
CGF
2008
15 years 6 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
133
click to vote
ANOR
2010
15 years 6 months ago
2010
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...
150
click to vote
IPL
2008
15 years 5 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...
140
Voted
STACS
1990
Springer
15 years 10 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...