188 search results - page 18 / 38 » The 2-center problem in three dimensions |
SIAMNUM
2011
13 years 4 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
MMM
2005
Springer
14 years 3 months ago
2005
Springer
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small ...
ICRA
2005
IEEE
14 years 3 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...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...