244 search results - page 13 / 49 » Compressive PCA on Graphs |
169
Voted
COLING
2010
15 years 1 months ago
2010
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
154
Voted
ICIP
2007
IEEE
16 years 20 days ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
172
Voted
TIT
2010
15 years 1 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
163
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
138
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...