59 search results - page 6 / 12 » A spectral bundle method with bounds |
172
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
163
click to vote
NIPS
2001
15 years 7 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
138
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
127
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper studies the detection of spectral targets corrupted by a colored Gaussian background from noisy, incoherent projection measurements. Unlike many detection methods desig...