285 search results - page 52 / 57 » Steaming on Convex Hulls |
IJCGA
2010
14 years 6 months ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
140
click to vote
CAD
2011
Springer
14 years 4 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
MP
2010
14 years 4 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
100
click to vote
PAMI
2012
12 years 12 months ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...