|
|
|
|
| LEADER |
01859 am a22003253u 4500 |
| 001 |
62809 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Gupta, Rishi V.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Indyk, Piotr
|e contributor
|
| 100 |
1 |
0 |
|a Indyk, Piotr
|e contributor
|
| 100 |
1 |
0 |
|a Gupta, Rishi V.
|e contributor
|
| 100 |
1 |
0 |
|a Price, Eric C.
|e contributor
|
| 700 |
1 |
0 |
|a Indyk, Piotr
|e author
|
| 700 |
1 |
0 |
|a Price, Eric C.
|e author
|
| 245 |
0 |
0 |
|a Sparse Recovery for Earth Mover Distance
|
| 260 |
|
|
|b University of Ilinois at Urbana-Champaign,
|c 2011-05-10T20:03:58Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/62809
|
| 520 |
|
|
|a URL to paper listed on conference site
|
| 520 |
|
|
|a We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specically, we design a distribution over m x n matrices A, for m << n, such that for any x, given Ax, we can recover a k-sparse approximation to x under the EMD distance. We also provide an empirical evaluation of the method that, in some scenarios, shows its advantages over the "usual" recovery in the lp norms.
|
| 520 |
|
|
|a David & Lucile Packard Foundation
|
| 520 |
|
|
|a Danish National Research Foundation (MADALGO (Center for Massive Data Algorithmics))
|
| 520 |
|
|
|a National Science Foundation (U.S.) (grant CCF-0728645)
|
| 520 |
|
|
|a Charles Stark Draper Laboratory
|
| 520 |
|
|
|a Cisco Community Fellowship Program
|
| 520 |
|
|
|a National Science Foundation (U.S.). Graduate Research Fellowship Program
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, 2010
|
