Sciweavers

515 search results - page 16 / 103
» Layouts of Expander Graphs
Sort
View
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
13 years 11 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
TOC
2010
147views Management» more  TOC 2010»
13 years 4 months ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 3 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
GD
1998
Springer
14 years 1 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
ICASSP
2009
IEEE
13 years 7 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
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...
M. Amin Khajehnejad, Babak Hassibi