Results 11 to 20 of about 3,587 (160)
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 sequence
Alois Panholzer, Helmut Prodinger
doaj +3 more sources
TreeSwift: A massively scalable Python tree package
SoftwareX, 2020 Phylogenetic trees are essential to evolutionary biology, and numerous methods exist that attempt to extract phylogenetic information applicable to a wide range of disciplines, such as epidemiology and metagenomics.
N. Moshiri
doaj +1 more source
Journal of Hydroinformatics, 2023 Wavelet-based grid resolution adaptation driven by the ‘multiresolution analysis’ (MRA) of the Haar wavelet (HW) allows to devise an adaptive first-order finite volume (FV1) model (HWFV1) that can readily preserve the modelling fidelity of its reference ...
Alovya Ahmed Chowdhury +3 more
doaj +1 more source
In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
IEEE Access, 2022 Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a
Jaehyeon Park +2 more
doaj +1 more source
Parsing as tree traversal [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form.
openaire +3 more sources
Multi-Robot Persistent Surveillance With Connectivity Constraints
IEEE Access, 2020 Mobile robots, especially unmanned aerial vehicles (UAVs), are of increasing interest for surveillance and disaster response scenarios. We consider the problem of multi-robot persistent surveillance with connectivity constraints where robots have to ...
Jurgen Scherer, Bernhard Rinner
doaj +1 more source
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
Journal of Graph Algorithms and Applications, 2004 We present new O(n)-time methods for planar embedding and Kuratowski subgraph isolation that were inspired by the Booth-Lueker PQ-tree implementation of the Lempel-Even-Cederbaum vertex addition method.
John Boyer, Wendy Myrvold
doaj +1 more source
A bounded-space tree traversal algorithm [PDF]
Information Processing Letters, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel S. Hirschberg, Steven S. Seiden
openaire +2 more sources
Ordered trees and the inorder traversal
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aristidis Sapounakis +2 more
openaire +1 more source
Efficient traversal of decision tree ensembles with FPGAs
Journal of Parallel and Distributed Computing, 2021 System-on-Chip (SoC) based Field Programmable Gate Arrays (FPGAs) provide a hardware acceleration technology that can be rapidly deployed and tuned, thus providing a flexible solution adaptable to specific design requirements and to changing demands.In this paper, we present three SoC architecture designs for speeding-up inference tasks based on ...
Romina Molina +5 more
openaire +3 more sources