2924 search results - page 152 / 585 » Lower Bounds in Distributed Computing |
113
Voted
ICSOC
2009
Springer
14 years 10 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
83
Voted
TIT
2008
15 years 20 days ago
2008
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...
95
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Practical schemes for distributed video coding with side information at the decoder need to consider non-standard correlation models in order to take non-stationarities into accou...