Sciweavers

19 search results - page 2 / 4
» A Faster Lattice Reduction Method Using Quantum Search
Sort
View
ICC
2007
IEEE
245views Communications» more  ICC 2007»
14 years 1 months ago
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
Feng Liu, Ling-ge Jiang, Chen He
ICDAR
2011
IEEE
12 years 6 months ago
Trie-Lexicon-Driven Recognition for On-line Handwritten Japanese Disease Names Using a Time-Synchronous Method
— This paper describes a lexicon-driven approach to on-line handwritten Japanese disease name recognition using a time-synchronous method. A trie lexicon is constructed from a di...
Bilan Zhu, Masaki Nakagawa
BIRTHDAY
2004
Springer
14 years 6 days ago
On NFA Reductions
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
Lucian Ilie, Gonzalo Navarro, Sheng Yu
ICASSP
2010
IEEE
13 years 1 months ago
Search error risk minimization in Viterbi beam search for speech recognition
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
CLA
2004
13 years 8 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua