Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
We present a new method for robustly decomposing a 3D voxel shape into disjoint segments using the medial surface, also called surface skeleton. The boundaries of the simplified ...