Sciweavers

1640 search results - page 58 / 328
» Conditional Independence Trees
Sort
View
99
Voted
FSTTCS
2008
Springer
15 years 3 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
ILP
2005
Springer
15 years 8 months ago
Generalization Behaviour of Alkemic Decision Trees
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
Kee Siong Ng
156
Voted
HASE
1998
IEEE
15 years 6 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...
134
Voted
GRAMMARS
2000
100views more  GRAMMARS 2000»
15 years 2 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
EACL
1993
ACL Anthology
15 years 3 months ago
Mathematical Aspects of Command Relations
In gb, the importance of phrase-structure rules has dwindled in favour of nearness conditions. Today, nearness conditions play a major role in defining the correct linguistic rep...
Marcus Kracht