Sciweavers

2484 search results - page 124 / 497
» Polymatroids with Network Coding
Sort
View
SIGCOMM
1996
ACM
14 years 5 days ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
ICIP
2005
IEEE
14 years 9 months ago
The role of the virtual channel in distributed source coding of video
In distributed video source coding side-information at the decoder is generated as a temporal prediction based on previous frames. This creates a virtual dependency channel betwee...
Ronald P. Westerlaken, Rene Klein Gunnewiek, Inald...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 2 months ago
Time-and-Frequency-Hopping Optical Orthogonal Codes with Hierarchical Cross-Correlation Constraints for Service Differentiation
— In this paper, we consider time-and-frequency hopping (TFH) codes for optical code-division multiple-access (OCDMA) networks. To support the differentiated service requirements...
Chung-Keun Lee, Seung-Woo Seo
SAC
2010
ACM
14 years 2 months ago
Feature interaction networks
A quantitative approach for measuring and describing feature interactions in object-oriented software components based on source code inspection is presented. The methodical arsen...
Stefan Sobernig
GLOBECOM
2008
IEEE
14 years 2 months ago
Network Resource Allocation for Competing Multiple Description Transmissions
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
Ying Li, Chao Tian, Suhas N. Diggavi, Mung Chiang,...