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...
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
Eight successively refined simulation models for the earthmoving operations involved in the construction of a dam provide the foundation for illustrating the ease and effectivenes...
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Imp...
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...