✦ LIBER ✦

Efficient Algorithms for Optimal Stream Merging for Media-on-Demand

✍ Scribed by Bar-Noy, Amotz; Ladner, Richard E.

Book ID: 118180421
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 251 KB
Volume: 33
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539701389245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of stream merging algorithms

Comparison of stream merging algorithms for media-on-demand

✍ Amotz Bar-Noy; Justin Goshi; RichardE. Ladner; Kenneth Tam 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 372 KB

Designing Efficient and Robust Caching A

Designing Efficient and Robust Caching Algorithms for Streaming-on-Demand Services on the Internet

✍ K. Y. Leung; Eric W. M. Wong; K. H. Yeung 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 558 KB

Generalized Greedy Broadcasting for Effi

Generalized Greedy Broadcasting for Efficient Media-on-Demand Transmissions

✍ Nikolaus, B.; Ott, J.; Bormann, C.; Bormann, U. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 246 KB

Fast optimal video placement algorithms

Fast optimal video placement algorithms for hierarchical video-on-demand systems

✍ Ren-Hung Hwang; Pin-Hao Chi 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 287 KB

Optimal real-time admission control algo

Optimal real-time admission control algorithms for the video-on-demand (VOD) service

✍ Lin, F.Y.-S. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 817 KB

Optimal and Efficient Algorithms for Sum

Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines

✍ Eunice E. Santos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 360 KB

The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is studied. We present optimal algorithms for summing and show that any optimal summing algorithm must have a certain inherent structure. Moreover, we present optimal or near-o