2600 search results - page 26 / 520 » Clustering with or without the Approximation |
149
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
153
click to vote
ALGORITHMICA
2005
15 years 5 months ago
2005
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
144
click to vote
PKC
2007
Springer
15 years 12 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
132
click to vote
QUESTA
2006
15 years 5 months ago
2006
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
156
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...