Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze,...
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...