Results 71 to 80 of about 1,259,069 (138)
Biology, 2016 Embryonic development proceeds through a series of differentiation events. The mosaic version of this process (binary cell divisions) can be analyzed by comparing early development of Ciona intestinalis and Caenorhabditis elegans.
Bradly Alicea, Richard Gordon
doaj +1 more source
Self-organizing binary split trees
, 1984 Binary split trees are a new means of storing records with skewed frequency distributions. We consider heuristics that reduce access time in binary split trees by organizing the trees dynamically so that the more frequently accessed keys are moved toward
Chen, Louis Hsiao-Yun, 1940-
core
An example related to Whitney’s extension problem for L 2,p (R2) when 1 < p < 2
Advanced Nonlinear StudiesIn this paper, we prove the existence of a bounded linear extension operator T:L2,p(E)→L2,p(R2) $T:{L}^{2,p}\left(E\right)\to {L}^{2,p}\left({\mathbb{R}}^{2}\right)$ when 1 < p < 2, where E⊂R2 $E\subset {\mathbb{R}}^{2}$ is a certain discrete set with ...
Carruth Jacob, Israel Arie
doaj +1 more source
On Optimal Binary Search Trees
, 2007 We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary ...
Alfredo De Santis, Roberto De Prisco
core
Permutations in Binary Trees and Split Trees.
, 2018 We investigate the number of permutations that occur in random node labellings of trees. This is a generalisation of the number of subpermutations occuring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees [Cai et al., 2017].
Michael Albert 0001 +3 more
openaire +3 more sources
evtree: Evolutionary Learning of Globally Optimal Classification and Regression Trees in R [PDF]
Commonly used classification and regression tree methods like the CART algorithm are recursive partitioning methods that build the model in a forward stepwise search.
Karl-Peter Pfeiffer +2 more
core
On $n$-equivalence of binary trees.
Notre Dame Journal of Formal Logic, 1987 The paper contains a simple characterization of the binary trees which satisfy the same first-order sentences of quantifier depth n as the binary tree with one root whose branches all have length m (for all n and m). It follows immediately that, e.g., ``finiteness'' is not a first- order property of binary trees. The proof employs the Ehrenfeucht game.
openaire +3 more sources
, 2007 . In this paper we consider the possibility of overcoming fragmentation during the construction of decision trees by dividing the values of discriminating nominal attributes into two groups and constructing only two subtrees, one for each group.
K. M. Ho and P. D. Scott +2 more
core
Comparing Leaf and Root Insertion
South African Computer Journal, 2010 We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations.
Jaco Geldenhuys, Brink van der Merwe
doaj
Comparison of various in-order iterator implementations in C++
Open Computer ScienceData structures typically use sequential or hierarchical arrangements of elements. Hierarchical data structures are commonly referred to as trees. Trees can be implemented and applied in various ways from simple to relatively sophisticated structures ...
Mrena Michal +3 more
doaj +1 more source