1414 search results - page 155 / 283 » Randomness and Universal Machines |
100
Voted
CORR
2007
Springer
15 years 22 days ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
125
click to vote
TIT
2010
14 years 7 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
130
click to vote
FSTTCS
1992
Springer
15 years 4 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
96
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper extends our previous work on feature transformationbased support vector machines for speaker recognition by proposing a joint MAP adaptation of feature transformation (...
71
Voted
AHS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present the initial results from the FHPCA Supercomputer project at the University of Edinburgh. The project has successfully built a general-purpose 64 FPGA computer and porte...