93 search results - page 9 / 19 » Alternation for Termination |
TES
2000
Springer
13 years 11 months ago
2000
Springer
There is a growing need for techniques that provide alternative means to access Web content and services, be it the ability to browse the Web through a voice interface like the Ph...
ESOP
2010
Springer
13 years 10 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
ACL
2006
13 years 8 months ago
2006
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
SP
2010
IEEE
13 years 5 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...