401 search results - page 3 / 81 » Sparse Quasi-Random Graphs |
124
Voted
ICASSP
2009
IEEE
15 years 14 days ago
2009
IEEE
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
148
Voted
FSTTCS
2010
Springer
15 years 2 days ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
133
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
166
Voted
WINE
2010
Springer
15 years 17 days ago
2010
Springer
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...
108
Voted
CPC
2010
15 years 3 days ago
2010