4112 search results - page 16 / 823 » Efficient Algorithms for the Spoonerism Problem |
124
click to vote
ACL
2009
14 years 11 months ago
2009
An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the f...
132
Voted
WAW
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
112
click to vote
ESA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
124
Voted
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
99
Voted
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...