S Wang, XD Gu, H Qin - 2008 IEEE conference on computer …, 2008 - ieeexplore.ieee.org
Automatic non-rigid registration of 3D time-varying data is fundamental in many vision and graphics applications such as facial expression analysis, synthesis, and recognition. Despite …
R Cogill, B Shrader… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler …
C Chen, Z Wu, X Yu, B Ma, C Li - EURASIP Journal on Wireless …, 2023 - Springer
We consider a fundamental file dissemination problem in a two-hop relay-based heterogeneous network consisting of a macro base station, a half-duplex relay station, and …
Y Yang, N Shroff - Proceedings of the thirteenth ACM international …, 2012 - dl.acm.org
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov …
R Cogill, B Shrader… - 2008 IEEE International …, 2008 - ieeexplore.ieee.org
We consider a problem of managing separate multicast sessions from a single transmitter. Each of K sessions has an associated packet stream, and a single transmitter must transmit …
Multicast transmission, in which data is sent from a source to multiple destinations, is an important form of data communication in wireless networks. Numerous applications require …
R Cogill, B Shrader… - 2008 46th Annual Allerton …, 2008 - ieeexplore.ieee.org
The use of random linear coding of packets is known to be beneficial for both multicast transmission as well as transmission over time-varying communication channels. In this …
A Aiswaryalakshmi, KP Megartha, L Muthulakshmi… - 2016 - academia.edu
Here, we characterize the throughput of a broad cast network with receivers using rate less codes with block size. We characterize the system throughput asymptotically. Specifically …