150 search results - page 15 / 30 » Compressive Sensing over Graphs |
158
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
207
Voted
AVI
2010
15 years 7 months ago
2010
As our ability to measure the world around us improves, we are quickly generating massive quantities of high-dimensional, spatial-temporal data. In this paper, we concern ourselve...
180
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper links two a priori different topics, group testing and traitor tracing. Group testing, as an instantiation of a compressed sensing problem over binary data, is indeed e...
172
Voted
CAL
2006
15 years 6 months ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
166
Voted
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...