196 search results - page 25 / 40 » Improving Placement under the Constant Delay Model |
111
click to vote
SPAA
1994
ACM
15 years 1 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
Spatially-correlated intra-die process variations result in significant core-to-core frequency variations in chip-multiprocessors. An analytical model for frequency island chip-mu...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...