150 search results - page 18 / 30 » Compressive Sensing over Graphs |
197
Voted
SRDS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
155
Voted
UAI
2008
15 years 7 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
152
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
176
Voted
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper presents a practical coding scheme for the direct symmetric multiterminal source coding problem with remote source, when the noise between the remote source and the obs...
138
Voted
CRYPTO
2007
Springer
16 years 16 days ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...