1615 search results - page 88 / 323 » Pathology in heuristic search |
107
click to vote
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
IUI
2009
ACM
15 years 8 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
105
click to vote
ICASSP
2010
IEEE
14 years 6 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...
INTERSPEECH
2010
14 years 6 months ago
2010
This paper describes improvements in a search error risk minimization approach to fast beam search for speech recognition. In our previous work, we proposed this approach to reduc...
BIOCOMP
2008
15 years 1 months ago
2008
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...