Results 31 to 40 of about 61,399 (161)
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
The universal homogeneous binary tree [PDF]
Journal of Logic and Computation, 2018 25 ...
Manuel Bodirsky +3 more
openaire +3 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
Counting smaller trees in the Tamari order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We introduce new combinatorial objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton ...
Grégory Chatel, Viviane Pons
doaj +1 more source
Combining Binary Search Trees [PDF]
, 2013 12 pages, 2 figures, ICALP ...
Erik D. Demaine +3 more
openaire +6 more sources
Two bijections on Tamari Intervals [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We use a recently introduced combinatorial object, the $\textit{interval-poset}$, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results.
Frédéric Chapoton +2 more
doaj +1 more source
Clifford Algebras, Spin Groups and Qubit Trees
Quanta, 2022 Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous ...
Alexander Yurievich Vlasov
doaj +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
The Geometry of Binary Search Trees [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 info:eu-repo/semantics ...
Demaine, Erik D. +4 more
openaire +2 more sources
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source