2084 search results - page 235 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ISLPED
1996
ACM
15 years 2 months ago
1996
ACM
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
112
click to vote
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
92
Voted
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
84
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
LOGCOM
2006
14 years 10 months ago
2006
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...