Sciweavers

1127 search results - page 108 / 226
» New Algorithms for Generalized Network Flows
Sort
View
DAC
2009
ACM
15 years 11 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
PLDI
2011
ACM
14 years 1 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
MST
2006
136views more  MST 2006»
14 years 10 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 5 months ago
Mixed-Membership Stochastic Block-Models for Transactional Networks
Abstract: Transactional network data can be thought of as a list of oneto-many communications (e.g., email) between nodes in a social network. Most social network models convert th...
Mahdi Shafiei, Hugh Chipman
SIGCOMM
2003
ACM
15 years 3 months ago
A knowledge plane for the internet
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
David D. Clark, Craig Partridge, J. Christopher Ra...