Sciweavers

150 search results - page 15 / 30
» Compressive Sensing over Graphs
Sort
View
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
Fishing in Poisson streams: focusing on the whales, ignoring the minnows
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...
Maxim Raginsky, Sina Jafarpour, Rebecca Willett, A...
AVI
2010
13 years 8 months ago
Wakame: sense making of multi-dimensional spatial-temporal data
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...
Clifton Forlines, Kent Wittenburg
ICASSP
2011
IEEE
12 years 11 months ago
Group testing meets traitor tracing
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...
Peter Meerwald, Teddy Furon
CAL
2006
13 years 7 months ago
A Case for Compressing Traces with BDDs
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...
Graham D. Price, Manish Vachharajani
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 11 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
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...
Xin He, Ming-Yang Kao, Hsueh-I Lu