Results 41 to 50 of about 3,587 (160)
The traversal method for user address space in Windows 10 system based on VAD tree
Xibei Gongye Daxue Xuebao, 2022 The existing traversal method for user address space in the memory forensic research is only applicable to Windows XP and Windows 7 32-bit system. Windows 10 64-bit system is currently used by most users, which is the main target of network attackers.
ZHAI Jiqiang +3 more
doaj +1 more source
pinktoe: Semi-automatic Traversal of Trees
Journal of Statistical Software, 2005 Tree based methods in S or R are extremely useful and popular. For simple trees and memorable variables it is easy to predict the outcome for a new case using only a standard decision tree diagram.
Guy P. Nason
doaj +1 more source
Inorder traversal of splay trees
Electronic Notes in Theoretical Computer Science, 2003 AbstractSplay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a 'splay heuristic'. Sleator and Tarjan showed that if amortised rather than worst-case times are considered, splay trees are ...
openaire +1 more source
Morris' tree traversal algorithm reconsidered
Science of Computer Programming, 1988 Algorithms of D. E. Knuth [\textit{D. E. Knuth}, The art of computer programming, Vol. 1: Fundamental Algorithms (Addison Wesley, (1968; Zbl 0191.179)] and of J. M. Morris [\textit{J. M. Morris}, Traversing binary trees simply and cheaply, Inf. Process. Lett.
Prabhaker Mateti, Ravi Manghirmalani
openaire +1 more source
Internal‐to‐internal transition method for consecutive hierarchical template matching
IET Computer Vision, 2014 This study proposes a method reducing the tree traversal cost by first investigating the most probable node instead of the root node when a hierarchical template matching is consecutively applied to the object.
Ho Gi Jung
doaj +1 more source
Research of algorithm of walking track for underground personnel
Gong-kuang zidonghua, 2014 For problems that current coal mine personnel positioning system adopts region positioning method, and cannot directly determine exact location and movement direction of underground personnel, an algorithm based on tree structure was proposed, which uses
ZHANG Xuan, LI Chonggui, YANG Fa
doaj +1 more source
Accelerated K-Means Algorithms for Low-Dimensional Data on Parallel Shared-Memory Systems
IEEE Access, 2021 This paper considers the problem of exact accelerated algorithms for the K-means clustering of low-dimensional data on modern multi-core systems. A version of the filtering algorithm parallelized using the OpenMP (Open Multi-Processing) standard is ...
Wojciech Kwedlo, Michal Lubowicz
doaj +1 more source
Genus Distributions of Cubic Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2011 We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders ...
Jonathan Gross
doaj +1 more source
The Expected Performance of Traversal Algorithms in Binary Trees [PDF]
The Computer Journal, 1985 The paper compares expected performance measures for common traversal algorithms operating on threaded and unthreaded binary trees, under the assumption that the trees are selected from the distribution induced by random insertions. The results are shown to be similar to those derived in an earlier paper for binary trees selected from the uniform ...
openaire +2 more sources
Traversing Grammar-Compressed Trees with Constant Delay [PDF]
2016 Data Compression Conference (DCC), 2016 A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such that equality of subtrees can be checked in constant time.
Markus Lohrey +2 more
openaire +3 more sources