Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used. © 1986 IEEE
Eric Price, David P. Woodruff
FOCS 2011
Rolf Clauberg
IBM J. Res. Dev
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Michael D. Moffitt
ICCAD 2009