2084 search results - page 190 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
155
click to vote
MST
2006
15 years 2 months ago
2006
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...
138
click to vote
ANTS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
113
Voted
BROADNETS
2005
IEEE
15 years 8 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
118
Voted
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
135
Voted
CCCG
1998
15 years 4 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...