Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
Decision trees are commonly used for classification. We propose to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because vi...
Abstract. In this paper we introduce a multi-stage decision making procedure where decision makers sort the alternatives by means of a fixed set of linguistic categories, each one...
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...