Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
1994
ACM

favoriteEmaildiscussreport

93views Algorithms» more STOC 1994»

Scalable expanders: exploiting hierarchical random wiring

13 years 8 months ago

Scalable expanders: exploiting hierarchical random wiring

Download www.cs.ucsb.edu

Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they become large. This paper introduces a technique for scaling expanders that avoids this wiring complexity. Specifically, we make the following contributions:

Eric A. Brewer, Frederic T. Chong, Tom Leighton

Real-time Traffic

Algorithms | STOC 1994 | Wired Expander-based Networks | Wiring Complexity |

claim paper

Related Content

» A new intrusion detection system using support vector machines and hierarchical clustering

» Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	STOC
Authors	Eric A. Brewer, Frederic T. Chong, Tom Leighton

Comments (0)