16257 search results - page 265 / 3252 » D-finiteness: algorithms and applications |
154
click to vote
ACL
2003
15 years 8 months ago
2003
This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of...
157
click to vote
COLING
2000
15 years 8 months ago
2000
35"ansfer-based Machine Translation systems require a procedure for choosing the set; of transfer rules for generating a target language translation from a given source langu...
154
click to vote
COLING
2000
15 years 8 months ago
2000
This paper describes a self-modelling, incremental algorithm for learning translation rules from existing bilingual corpora. The notions of supracontext and subcontext are extende...
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
153
click to vote
ENDM
2010
15 years 6 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...