Sciweavers

92 search results - page 10 / 19
» Optimal versus Heuristic Global Code Scheduling
Sort
View
95
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
Ulas C. Kozat
85
Voted
DAC
2006
ACM
15 years 3 months ago
Buffer memory optimization for video codec application modeled in Simulink
Reduction of the on-chip memory size is a key issue in video codec system design. Because video codec applications involve complex algorithms that are both data-intensive and cont...
Sang-Il Han, Xavier Guerin, Soo-Ik Chae, Ahmed Ami...
ISCC
2008
IEEE
15 years 4 months ago
Scheduling high-rate sessions in Fractional Lambda Switching networks: Algorithm and analysis
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
Thu-Huong Truong, Mario Baldi, Yoram Ofek
88
Voted
WWW
2009
ACM
15 years 10 months ago
Extracting article text from the web with maximum subsequence segmentation
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
Jeff Pasternack, Dan Roth
INFOCOM
2010
IEEE
14 years 8 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li