Results 51 to 60 of about 1,259,069 (138)
Characterization of binary trees [PDF]
In "Level Number Sequences for Trees" Flagotet and Prodinger investigate the problem of counting the number of level number sequences associated to binary trees of $n$ binary nodes. I convert this problem into terms of exterior nodes or "leaves" and leaf
Brandstetter, Griffin
core +6 more sources
CoRR, 2013 Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)
openaire +4 more sources
Some structures of the catalan numbers I [PDF]
ریاضی و جامعهThe Catalan numbers are ubiquitous in counting problems which is one of the primary reasons for its popularity. From various sources like books and Wikipedia we see that in combinatorial mathematics.
Daniel Yaqubi, Madjid Mirzavaziri
doaj +1 more source
On the depth of decision trees over infinite 1-homogeneous binary information systems
Array, 2021 In this paper, we study decision trees, which solve problems defined over a specific subclass of infinite information systems, namely: 1-homogeneous binary information systems. It is proved that the minimum depth of a decision tree (defined as a function
Mikhail Moshkov
doaj +1 more source
International audienceThis paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule.
Bodini, Olivier +2 more
core +5 more sources
, 1976 Binary Trees are examined combinatorially with the view of providing information useful in analyzing algorithms based on this widely used storage structure.
Shubert, Bruno O., Brown, Gerald G.
core +3 more sources
Journal of Statistical Software, 2017 msBP is an R package that implements a new method to perform Bayesian multiscale nonparametric inference introduced by Canale and Dunson (2016). The method, based on mixtures of multiscale beta dictionary densities, overcomes the drawbacks of Pólya trees
Antonio Canale
doaj +1 more source
On the Depth of Decision Trees with Hypotheses
Entropy, 2022 In this paper, based on the results of rough set theory, test theory, and exact learning, we investigate decision trees over infinite sets of binary attributes represented as infinite binary information systems.
Mikhail Moshkov
doaj +1 more source
, 2023 We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers to the set (resp. multiset) of leaf induced binary subtrees of $T$.
Dossou-Olory, Audace +7 more
core
Random Records and Cuttings in Split Trees: Extended Abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of records in random split trees on $n$ randomly labelled vertices. Equivalently the number of random cuttings required to eliminate an arbitrary random split tree can be studied.
Cecilia Holmgren
doaj +1 more source