7259 search results - page 1194 / 1452 » From Fields to Trees |
172
click to vote
ICDT
2007
ACM
16 years 27 days ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
202
click to vote
MCS
2007
Springer
16 years 27 days ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
198
click to vote
RTA
2007
Springer
16 years 26 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
157
click to vote
TABLEAUX
2007
Springer
16 years 26 days ago
2007
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
200
click to vote
TLCA
2007
Springer
16 years 26 days ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...