3818 search results - page 70 / 764 » Word Problems on Compressed Words |
139
click to vote
ACL
2009
15 years 2 months ago
2009
Often, Statistical Machine Translation (SMT) between English and Korean suffers from null alignment. Previous studies have attempted to resolve this problem by removing unnecessar...
171
click to vote
ACL
2012
13 years 6 months ago
2012
The dominant practice of statistical machine translation (SMT) uses the same Chinese word segmentation specification in both alignment and translation rule induction steps in buil...
128
click to vote
INFORMATICALT
2007
15 years 4 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
122
click to vote
CPM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
138
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Dictionary code compression is a technique where long instructions in the memory are replaced with shorter code words used as index in a table to look up the original instructions...