4666 search results - page 387 / 934 » Equations on Timed Languages |
188
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
164
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
183
click to vote
JLP
2007
15 years 6 months ago
2007
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
172
click to vote
EMNLP
2010
15 years 4 months ago
2010
Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of...
169
click to vote
EMNLP
2009
15 years 4 months ago
2009
Current statistical machine translation systems usually extract rules from bilingual corpora annotated with 1-best alignments. They are prone to learn noisy rules due to alignment...