3244 search results - page 529 / 649 » On convex complexity measures |
176
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
192
click to vote
PPNA
2011
15 years 1 months ago
2011
The proliferation of novel wireless network technologies creates new opportunities for complex peerto-peer information dissemination systems. A key challenge that remains in this a...
139
click to vote
TCOM
2011
15 years 1 months ago
2011
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
185
click to vote
TSP
2011
15 years 1 months ago
2011
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
201
click to vote
PAMI
2010
15 years 1 months ago
2010
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...