5793 search results - page 282 / 1159 » Individual communication complexity |
181
click to vote
PDP
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
176
click to vote
WDAG
1998
Springer
15 years 11 months ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
177
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
177
click to vote
ESORICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
264
Voted
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...