This paper presents a bijection between combinatorial maps and a class of enriched trees, corresponding to a class of expression trees in some logical systems (constrained lambda terms). Starting from two alternative definitions of combinatorial maps: the classical definition by gluing halfedges, and a definition by non-ambiguous depth-first traversal, we derive non-trivial asymptotic expansion...

Generator is a concise representation for frequent itemset. And it has the anti-monotone property as the frequent itemset does, which is an important property in real applications. But when itemsets are attached with weights to balance importances between themselves, the anti-monotone property of generator may not hold. Additionally generator with weight may become tough to be dealt with in man...

Let G be a graph consisting of a complete binary tree of depth h together with one back edge leading from each leaf to one of its ancestors, and suppose that the girth ofG exceeds g. Let h = h(g) be the minimum possible depth of such a graph. The existence of such graphs, for arbitrarily large g, is proved in [2], where it is shown that h(g) is at most some version of the Ackermann function. He...

We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very long. The search strategy of our algorithm integrates a depth-first traversal of the itemset lattice with effective pruning mechanisms. Our implementation of the search strategy combines a vertical bitmap representation o...

The DDα-procedure is a fast nonparametric method for supervised classification of d-dimensional objects into q ≥ 2 classes. It is based on q-dimensional depth plots and the α-procedure, which is an efficient algorithm for discrimination in the depth space [0, 1] . Specifically, we use two depth functions that are well computable in high dimensions, the zonoid depth and the random Tukey depth, a...

In this paper we investigate the reduction of the size for small depth feed-forward linear threshold networks performing binary addition, comparison, and related functions. For n bit operands we propose a depth-3 O(n 2 log n) asymptotic size network for the binary addition with polynomially bounded weights. We propose also a depth-3 addition of optimal O(n) asymptotic size network and a depth-2...

This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach ...

We investigate some conditions for data to be discarded, independently of the chosen concept learning algorithm or concept representation language. Then an algorithm for discarding data is presented in the framework of Iterative Versionspaces, which is a depth-first algorithm computing versionspaces as introduced by Mitchell. We update the datastructures used in the Iterative Versionspaces algo...

Suenaga et al. have developed a type-based framework for automatically translating tree-processing programs into streamprocessing ones. The key ingredient of the framework was the use of ordered linear types to guarantee that a treeprocessing program traverses an input tree just once in the depth-first, left-to-right order (so that the input tree can be read from a stream). Their translation, h...