10493 search results - page 55 / 2099 » Dynamic Word Problems |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
COLING
2000
13 years 9 months ago
2000
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesm...
ACL
2010
13 years 5 months ago
2010
Finding allowable places in words to insert hyphens is an important practical problem. The algorithm that is used most often nowadays has remained essentially unchanged for 25 yea...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...