2040 search results - page 154 / 408 » On the Complexity of Error Explanation |
173
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
130
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--This paper addresses pilot-assisted channel estimation for wireless orthogonal frequency division multiplexing (OFDM) systems with irregular pilot arrangements. Using non...
147
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
153
click to vote
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
− To facilitate training and planning for medical procedures such as prostate brachytherapy, we are developing an interactive simulation of needle insertion and radioactive seed ...
128
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...