103 search results - page 11 / 21 » Rate of decay of s-numbers |
JMLR
2006
13 years 8 months ago
2006
We study some stability properties of algorithms which minimize (or almost-minimize) empirical error over Donsker classes of functions. We show that, as the number n of samples gr...
STOC
1997
ACM
14 years 23 days ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...