Sciweavers

1000 search results - page 88 / 200
» Dependency Tree Automata
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
14 years 12 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
EACL
1993
ACL Anthology
15 years 1 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
RE
2008
Springer
14 years 11 months ago
Requirements Capture with RCAT
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
Margaret H. Smith, Klaus Havelund
AMAI
2005
Springer
14 years 11 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 9 days ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer