Results 41 to 50 of about 61,399 (161)
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Algorithms, 2021 Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.
David Schaller +3 more
doaj +1 more source
Pointed Binary Encompassing Trees [PDF]
, 2004 We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T, that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v $\in$ T is pointed, that is, v has an incident angle greater than $\pi$.
Michael Hoffmann 0001 +2 more
openaire +2 more sources
CoRR, 2013 Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)
openaire +3 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 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
Constructing Binary Huffman Tree
Formalized Mathematics, 2013 Summary Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm.
Hiroyuki Okazaki +2 more
openaire +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 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
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
IEEE Access, 2019 Several synchronous applications are based on the graph-structured data; among them, a very important application of this kind is community detection.
Stavros Souravlas +2 more
doaj +1 more source