3690 search results - page 197 / 738 » Computation with classical sequents |
108
click to vote
DLT
2009
14 years 10 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
133
click to vote
ACS
2011
14 years 7 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
130
Voted
CAD
2011
Springer
14 years 7 months ago
2011
Springer
Converting a quadrilateral input mesh into a C1 surface with one bi-3 tensorproduct spline patch per facet is a classical challenge. We give explicit local averaging formulas for ...
97
Voted
ACL
2012
13 years 3 months ago
2012
We investigate the potential of Tree Substitution Grammars as a source of features for native language detection, the task of inferring an author’s native language from text in ...
134
Voted
ACL
2012
13 years 3 months ago
2012
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of cla...