544 search results - page 58 / 109 » On achieving optimal throughput with network coding |
164
click to vote
DIALM
2007
ACM
15 years 5 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
101
click to vote
LCPC
2005
Springer
15 years 7 months ago
2005
Springer
Programming network processors remains a challenging task since their birth until recently when high-level programming environments for them are emerging. By employing domain speci...
210
click to vote
ASPLOS
2009
ACM
16 years 2 months ago
2009
ACM
In this paper we describe a GPU parallelization of the 3D finite difference computation using CUDA. Data access redundancy is used as the metric to determine the optimal implement...
124
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
109
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...