Sciweavers

678 search results - page 10 / 136
» Structural Properties of Sparse Graphs
Sort
View
CISS
2011
IEEE
13 years 1 months ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
12 years 15 days ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
VMCAI
2009
Springer
14 years 4 months ago
Reducing Behavioural to Structural Properties of Programs with Procedures
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Dilian Gurov, Marieke Huisman
WINE
2010
Springer
177views Economy» more  WINE 2010»
13 years 8 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
Fan Chung, Stephen J. Young
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 8 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille