Results 21 to 30 of about 41,749 (283)
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
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Hendrik Jan Hoogeboom +2 more
core +5 more sources
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
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 +4 more
doaj +2 more sources
A Generic Framework for Engineering Graph Canonization Algorithms [PDF]
, 2017 The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation.
Andersen, Jakob L., Merkle, Daniel
core +2 more sources
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
Electromagnetic simulation acceleration algorithm based on improved SAH-BVH [PDF]
AIP AdvancesRay 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
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
New techniques for trail bounds and application to differential trails in Keccak
IACR Transactions on Symmetric Cryptology, 2017 We present new techniques to efficiently scan the space of high-probability differential trails in bit-oriented ciphers. Differential trails consist in sequences of state patterns that we represent as ordered lists of basic components in order to arrange
Silvia Mella +2 more
doaj +1 more source
Tame combing and almost convexity conditions [PDF]
, 2010 We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set.
Cleary, Sean +3 more
core +3 more sources