2926 search results - page 355 / 586 » Partially Optimal Routing |
145
click to vote
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
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...
ICCD
2005
IEEE
16 years 15 days ago
2005
IEEE
The formal analysis of parallelism and pipelining is performed on an 8-bit Add-Compare-Select element of a Viterbi decoder. The results are quantified through a study of the delay...
123
click to vote
HM
2007
Springer
15 years 9 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
81
Voted
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination det...
131
Voted
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...