198 search results - page 36 / 40 » A practical algorithm for constructing oblivious routing sch... |
195
click to vote
DAC
2011
ACM
13 years 11 months ago
2011
ACM
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
103
click to vote
SIGCOMM
2006
ACM
15 years 5 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
103
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
101
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...