99 search results - page 1 / 20 » Approximation Hardness and Secure Communication in Broadcast... |
ASIACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
NETWORKS
2006
13 years 4 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
TELSYS
2008
13 years 4 months ago
2008
Abstract Technological evolution is leading telecommunications toward all-IP scenarios, where multiple services are transported as IP packets. Among these services is the broadcast...
TWC
2008
13 years 4 months ago
2008
Scheduling in a broadcast channel based on partial channel-state-information at the transmitter is carried out in an opportunistic way. In this paper, the number of generated beams...