Sciweavers

1414 search results - page 46 / 283
» Cover Time and Broadcast Time
Sort
View
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 11 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein
IPPS
2006
IEEE
14 years 4 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti
WWW
2004
ACM
14 years 10 months ago
Scheduling web requests in broadcast environments
On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time con...
Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu
ICMCS
2005
IEEE
127views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Asynchronous Media Streaming Over Wireless Broadcast Channels
We consider wireless broadcasting of multimedia content to allow asynchronous media access. Receivers subscribe at any time to the ongoing broadcast session, but are still able to...
Hrvoje Jenkac, Thomas Stockhammer
FC
2006
Springer
96views Cryptology» more  FC 2006»
14 years 1 months ago
Privacy in Encrypted Content Distribution Using Private Broadcast Encryption
In many content distribution systems it is important both to restrict access to content to authorized users and to protect the identities of these users. We discover that current s...
Adam Barth, Dan Boneh, Brent Waters