Sciweavers

575 search results - page 32 / 115
» A Spectral Approach to Lower Bounds
Sort
View
DAC
1995
ACM
14 years 1 months ago
The Elmore Delay as a Bound for RC Trees with Generalized Input Signals
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
Rohini Gupta, Byron Krauter, Bogdan Tutuianu, John...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 3 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 9 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
CODES
2006
IEEE
14 years 3 months ago
Bounded arbitration algorithm for QoS-supported on-chip communication
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
Mohammad Abdullah Al Faruque, Gereon Weiss, Jö...
FOCS
2006
IEEE
14 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans