Results 1 to 10 of about 3,587 (160)
Inversion of a recursive tree traversal [PDF]
Information Processing Letters, 1991 Accepted Version - 91-07.pdf Accepted Version - postscript ...
exaly +4 more sources
Interpretable molecular decision-making with DNA-based scalable and memory-efficient tree computation [PDF]
Nature CommunicationsDNA computing has emerged as a transformative paradigm for tackling computational problems at the molecular level, yet existing approaches remain constrained in algorithmic interpretability, efficiency, and scalability.
Junlan Liu +8 more
doaj +2 more sources
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yakov Nekrich +2 more
exaly +4 more sources
Merkle Tree Traversal in Log Space and Time [PDF]
Lecture Notes in Computer Science, 2004 We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of computation are hash function evaluations or leaf value computations, and the units of ...
Szydlo Michael
exaly +2 more sources
Binary apple tree: A game approach to tree traversal algorithms
2012 International Conference on Information Technology Based Higher Education and Training (ITHET), 2012 The computer science students mostly face with the difficulties in learning the topics of algorithms courses. Only listening the topic from the teacher or just writing makes the learning volatile. Instead of listening or writing, if there is something visual, it would be more permanent to learn because visuality increases the learning potential and the
, Resul Kara
exaly +3 more sources
Reasoning about recursive tree traversals [PDF]
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021 Traversals are commonly seen in tree data structures, and performance-enhancing transformations between tree traversals are critical for many applications. Existing approaches to reasoning about tree traversals and their transformations are ad hoc, with various limitations on the class of traversals they can handle, the granularity of dependence ...
Yanjun Wang 0010 +3 more
openaire +2 more sources
SpecMCTS: Accelerating Monte Carlo Tree Search Using Speculative Tree Traversal
IEEE Access, 2021 Monte Carlo Tree Search (MCTS) algorithms show outstanding strengths in decision-making problems such as the game of Go. However, MCTS requires significant computing loads to evaluate many nodes in the decision tree to make a good decision. Parallelizing
Juhwan Kim, Byeongmin Kang, Hyungmin Cho
doaj +1 more source
Novel Static Multi-Layer Forest Approach and Its Applications
Mathematics, 2021 The existing multi-layer tree is of dynamic linked list type which has many limitations and is complicated due to the pointer-node structure. Static array representation gives more flexibility in programming of algorithms and operations like insertion ...
Ganesh Bhagwat +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
Deep Forest and Pruned Syntax Tree-Based Classification Method for Java Code Vulnerability
Mathematics, 2023 The rapid development of J2EE (Java 2 Platform Enterprise Edition) has brought unprecedented severe challenges to vulnerability mining. The current abstract syntax tree-based source code vulnerability classification method does not eliminate irrelevant ...
Jiaman Ding, Weikang Fu, Lianyin Jia
doaj +1 more source