Results 21 to 30 of about 3,587 (160)

Splaying a search tree in preorder takes linear time

International Journal of Mathematics and Mathematical Sciences, 1991
In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed in the preorder sequence of T then the total time is O(n). This is a special case of the splay tree traversal conjecture of Sleator and Tarjan.
R. Chaudhuri, H. Höft
doaj   +1 more source

A Type of Energy-Balanced Tree Based Data Collection Strategy for Sensor Network With Mobile Sink

IEEE Access, 2019
In order to improve the sensing efficiency of the sensor network, a type of energy-balanced tree-based data collection strategy with mobile Sink (ETDC) is proposed.
Chao Sha, Dandan Song, Rui Yang, Hancheng Gao, Haiping Huang   +4 more
doaj   +1 more source

Mixed Path HMC Sampling Methods for Molecular Tree Spaces [PDF]

Jisuanji kexue, 2023
With the increasing abundance of modern molecular sequence data and the dramatic expansion of the tree-like topological space describing historical relationships between species,reliable inference of phylogenetic trees continues to face enormous ...
LI Xiaopeng, LING Cheng, GAO Jingyang
doaj   +1 more source

Splaying a search tree in preorder takes linear time

International Journal of Mathematics and Mathematical Sciences, 1990
In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed according to the preorder sequence of T then the total time is O(n). This is a special case of the splay tree traversal conjecture of Sleator and Tarjan [1].
R. Chaudhuri, H. Höft
doaj   +1 more source

Visible Reverse View Field K-Nearest Neighbor Queries in Obstacle Environment [PDF]

Jisuanji gongcheng, 2022
In spatial applications used in obstacle environments, users are usually only interested in visible data objects within the field of view.To solve the problem of a reverse nearest-neighbor query within the field of view in an obstacle environment, view ...
YANG Zexue, WANG Achuan, LI Lu, LI Song
doaj   +1 more source

Automatically enhancing locality for tree traversals with traversal splicing [PDF]

Proceedings of the ACM international conference on Object oriented programming systems languages and applications, 2012
Generally applicable techniques for improving temporal locality in irregular programs, which operate over pointer-based data structures such as trees and graphs, are scarce. Focusing on a subset of irregular programs, namely, tree traversal algorithms like Barnes-Hut and nearest neighbor, previous work has proposed point blocking, a technique analogous
Jo, Youngjoon, Kulkarni, Milind
openaire   +1 more source

Object-oriented Tree Traversal with JJForester

Electronic Notes in Theoretical Computer Science, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tobias Kuipers, Joost Visser 0001
openaire   +1 more source

Depth first traversal algorithm for the back-off tree of distributed queuing

Tongxin xuebao, 2021
An analytic model was provided for the conventional distributed queueing (DQ) and its back-off tree operations, followed by a design of improving algorithm based on depth first traversal.Combing the specific analysis of complete binary tree with ...
Wennai WANG, Yanhe ZHANG, Wei WU, Chen BAI, Bin WANG   +4 more
doaj   +2 more sources

Electromagnetic simulation acceleration algorithm based on improved SAH-BVH [PDF]

AIP Advances
Ray tracing is an important computational method in electromagnetism. To improve the efficiency of electromagnetic simulation, spatial division structures such as the Bounding Volume Hierarchy (BVH) are often used to accelerate calculations. Studies have
Min Huang, Sixuan Li, Qiuhong Sun
doaj   +1 more source

Picture Segmentation by a Tree Traversal Algorithm

Journal of the ACM, 1976
In the past, picture segmentation has been performed by merging small primitive regions or by recursively splitting the whole picture. This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements. The data structure is described in detail and examples of implementations are given.
Steven L. Horowitz, Theodosios Pavlidis
openaire   +1 more source