2084 search results - page 159 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
131
click to vote
TCS
1998
15 years 4 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
153
Voted
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
173
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
161
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
155
click to vote
PAMI
2007
15 years 4 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...