2084 search results - page 198 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
111
click to vote
MOBICOM
2000
ACM
15 years 7 months ago
2000
ACM
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
116
Voted
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
We present the Distributed Executor for RSES (DIXER) which is a supplementary software for the Rough Set Exploration System (RSES). It takes an advantage of grid computing paradigm...
141
click to vote
JOC
2007
15 years 2 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
126
click to vote
AAECC
2005
Springer
15 years 2 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
137
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...