312 search results - page 31 / 63 » Iterative compression and exact algorithms |
SODA
2012
ACM
12 years 9 days ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
KDD
1998
ACM
14 years 2 months ago
1998
ACM
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
DCC
2001
IEEE
14 years 9 months ago
2001
IEEE
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimiz...
TIT
2010
13 years 4 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
NIPS
1997
13 years 11 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...