306 search results - page 4 / 62 » On the Minimal Uncompletable Word Problem |
FOSSACS
2011
Springer
12 years 10 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
SIAMSC
2010
13 years 5 months ago
2010
A surface reconstruction technique based on minimization of the total variation of the gradient is introduced. Convergence of the method is established, and an interior-point algor...
ACL
2010
13 years 5 months ago
2010
The pipeline of most Phrase-Based Statistical Machine Translation (PB-SMT) systems starts from automatically word aligned parallel corpus. But word appears to be too fine-grained ...
PPSN
2004
Springer
14 years 21 days ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
JUCS
2006
13 years 7 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...