Results 11 to 20 of about 1,378,752 (293)
Mathematics of Operations Research, 1984 A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
core +5 more sources
A navigation system for tree space
Journal of Graph Algorithms and Applications, 2016 The reconstruction of evolutionary trees from data sets on overlapping sets of species is a central problem in phylogenetics. Provided that the tree reconstructed for each subset of species is rooted and that these trees fit together consistently, the ...
Sarah Mark, Jeanette McLeod, Mike Steel
doaj +3 more sources
Modification of hashing algorithm to increase rate of operations in nosql databases
Adaptivni Sistemi Avtomatičnogo Upravlinnâ, 2021 The object of research is indexing methods in non-relational databases. The article reviews the most common hashing algorithms and the proposed hashing algorithm based on prime numbers and binary number system.
В. Нікітін +3 more
doaj +1 more source
Representation of binary classification trees with binary features by quantum circuits [PDF]
Quantum, 2022 We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision tree can be ...
Raoul Heese +2 more
doaj +1 more source
Lattice of combinatorial Hopf algebras: binary trees with multiplicities [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras.
Jean-Baptiste Priez
doaj +1 more source
Simple Balanced Binary Search Trees [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations.
Prabhakar Ragde
doaj +1 more source
The Maximum Binary Tree Problem [PDF]
Algorithmica, 2021 to be published in European Symposium on Algorithms ...
Karthekeyan Chandrasekaran +5 more
openaire +6 more sources
Hybrid CPU-GPU Community Detection in Weighted Networks
IEEE Access, 2020 Recently, a new trend has emerged in the field of parallel and high performance computing, the hybrid implementation using CPU-GPU modules. In such implementations, the computational load is shared between the CPU and GPU, in order to improve the ...
Stavros Souravlas +2 more
doaj +1 more source
Descendants and ascendants in binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 There are three classical algorithms to visit all the nodes of a binary tree-preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the ...
Alois Panholzer, Helmut Prodinger
doaj +2 more sources
Journal of Statistical Software, 2021 In this article, we introduce the BART R package which is an acronym for Bayesian additive regression trees. BART is a Bayesian nonparametric, machine learning, ensemble predictive modeling method for continuous, binary, categorical and time-to-event ...
Rodney Sparapani +2 more
doaj +1 more source