2040 search results - page 57 / 408 » On the Complexity of Error Explanation |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
TSP
2008
13 years 9 months ago
2008
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
CRYPTO
2009
Springer
14 years 1 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
JCM
2008
13 years 9 months ago
2008
In this paper we revisit the minimum mean square error (MMSE) pilot-aided channel estimation for broadband orthogonal frequency division multiplexing (OFDM) systems. The careful de...