89 search results - page 7 / 18 » Using convex hulls to represent classifier conditions |
DAM
2007
13 years 7 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper addresses the problem of testing whether three contact points form a 3-fingered force-closure grasp in two dimensions. In particular, assuming frictional point cont...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
Image segmentation of natural scenes constitutes a major problem in Machine Vision. This paper presents a new proposal for the image segmentation problem which has been based on t...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...