806 search results - page 43 / 162 » Lower Bounds on Correction Networks |
159
click to vote
LOGCOM
2002
15 years 5 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
156
click to vote
MOBIHOC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
181
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
173
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
142
click to vote
MMS
1998
15 years 5 months ago
1998
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...