2286 search results - page 184 / 458 » Algorithms for Categorical Equivalence |
146
click to vote
ACL
2006
15 years 8 months ago
2006
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
156
click to vote
BSL
2008
15 years 6 months ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
150
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
State estimation problems for linear time-invariant systems with noisy inputs and outputs are considered. An efficient recursive algorithm for the smoothing problem is presented. ...
170
click to vote
JCO
2007
15 years 6 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
194
click to vote
JSC
2007
15 years 6 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...