150 search results - page 18 / 30 » Compressive Sensing over Graphs |
SRDS
2010
IEEE
13 years 5 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...
UAI
2008
13 years 8 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...
CORR
2010
Springer
13 years 7 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...
ICASSP
2009
IEEE
14 years 2 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...
CRYPTO
2007
Springer
14 years 1 months 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...