3244 search results - page 183 / 649 » On convex complexity measures |
100
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
105
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
128
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
129
click to vote
GLOBECOM
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper, we first provide a joint source and channel coding (JSCC) approach in estimating Gaussian sources over Gaussian MAC channels, as well as its sufficient and necessary...
135
click to vote
DCG
2010
15 years 2 months ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...