11384 search results - page 399 / 2277 » Achieved IPC Performance |
157
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimall...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the syst...
100
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
124
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
130
click to vote
CN
2007
15 years 4 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...