208 search results - page 42 / 42 » Optimal SINR-based Random Access |
163
Voted
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
181
Voted
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
175
Voted
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...