Results 31 to 40 of about 1,259,069 (138)
Grid Drawings of Binary Trees: An Experimental Study
Journal of Graph Algorithms and Applications, 2008 In this paper we consider the class of binary trees and present the results of a comprehensive experimental study on the four most representative algorithms for drawing trees, one for each of the following tree-drawing approaches: Separation-Based, Path-
Adrian Rusu, Confesor Santiago
doaj +1 more source
The Cambrian Hopf Algebra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees.
G. Chatel, V. Pilaud
doaj +1 more source
The algebra of binary trees is affine complete [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet containing at ...
Andre Arnold +3 more
doaj +1 more source
Unbiased split selection for classification trees based on the Gini Index [PDF]
, 2005 The Gini gain is one of the most common variable selection criteria in machine learning. We derive the exact distribution of the maximally selected Gini gain in the context of binary classification using continuous predictors by means of a combinatorial ...
Carolin Strobla +8 more
core +1 more source
Topological and categorical properties of binary trees
Applied General Topology, 2008 Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements.
H. Pajoohesh
doaj +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
Combinatorics of non-ambiguous trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault ...
Jean-Christophe Aval +3 more
doaj +1 more source
Biology, 2023 In this article, we propose a comparative study between two models that can be used by researchers for the analysis of survival data: (i) the Weibull regression model and (ii) the random survival forest (RSF) model.
Thalytta Cavalcante +4 more
doaj +1 more source
Maximally selected chi-square statistics and binary splits of nominal variables [PDF]
, 2005 We address the problem of maximally selected chi-square statistics in the case of a binary Y variable and a nominal X variable with several categories. The distribution of the maximally selected chi-square statistic has already been derived when the best
Anne-laure Boulesteix +2 more
core +2 more sources
Right-cancellability of a family of operations on binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 We prove some new results on a family of operations on binary trees, some of which are similar to addition, multiplication and exponentiation for natural numbers. The main result is that each operation in the family is right-cancellable.
Philippe Duchon
doaj +1 more source