1397 search results - page 8 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
PAMI
2012
11 years 9 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...
SIAMJO
2011
13 years 2 months ago
2011
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point with coordinates) and replaces it with a well-shape...
TAPIA
2003
ACM
14 years 18 days ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
ICALP
2010
Springer
14 years 5 days ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...