1222 search results - page 181 / 245 » corr 2008 |
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
182
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper studies the performance of hybrid-ARQ (automatic repeat request) in Rayleigh blockfading channels. The long-term average transmitted rate is analyzed in a fast-fading s...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The cooperative automatic repeat request (C-ARQ) is a link layer relaying protocol which exploits the spatial diversity and allows the relay node to retransmit the source data pac...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...