44 search results - page 2 / 9 » Basis Reduction, and the Complexity of Branch-and-Bound |
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...
TASLP
2008
13 years 4 months ago
2008
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
INTERSPEECH
2010
12 years 11 months ago
2010
This corpus-based study shows that the presence and duration of schwa in Dutch word-initial syllables are affected by a word's predictability and its morphological structure....
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...