292 search results - page 19 / 59 » A linearization of the Lambda-calculus and consequences |
115
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
121
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
120
click to vote
DASFAA
2008
IEEE
15 years 3 months ago
2008
IEEE
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
102
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
118
click to vote
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...