Sciweavers

3527 search results - page 430 / 706
» Gaussianization
Sort
View
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
15 years 3 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
Piotr Sniady
IJON
2006
99views more  IJON 2006»
15 years 3 months ago
Learning vector quantization: The dynamics of winner-takes-all algorithms
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...
Michael Biehl, Anarta Ghosh, Barbara Hammer
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 3 months ago
Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?
— In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding ove...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...
111
Voted
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 3 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
JCM
2008
76views more  JCM 2008»
15 years 3 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan