Results 31 to 40 of about 352,001 (275)
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
Binary trees, coproducts, and integrable systems [PDF]
, 2010 We provide a unified framework for the treatment of special integrable systems which we propose to call "generalized mean field systems". Thereby previous results on integrable classical and quantum systems are generalized.
Arnol'd V I +12 more
core +3 more sources
XML Compression via DAGs [PDF]
, 2013 Unranked trees can be represented using their minimal dag (directed acyclic graph). For XML this achieves high compression ratios due to their repetitive mark up. Unranked trees are often represented through first child/next sibling (fcns) encoded binary
Bousquet-Melou, Mireille +3 more
core +1 more source
On Succinct Representations of Binary Trees [PDF]
Mathematics in Computer Science, 2017 Journal version of part of COCOON 2012 ...
Pooya Davoodi +2 more
openaire +3 more sources
Representing and retrieving regions using binary partition trees [PDF]
, 1999 This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval.
Casas Pla, Josep Ramon +2 more
core +1 more source
Combining Binary Search Trees [PDF]
, 2013 12 pages, 2 figures, ICALP ...
Erik D. Demaine +3 more
openaire +6 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
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
Toric ideals of homogeneous phylogenetic models
, 2004 We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree.
Eriksson, Nicholas
core +2 more sources