• OBBTree

  • Referenced in 30 articles [sw33406]
  • OBBTrees). At runtime, the algorithm traverses two such trees and tests for overlaps between oriented...
  • exafmm

  • Referenced in 8 articles [sw30090]
  • Based on Dual Tree Traversal for Many-core Architectures. The present work attempts to integrate ... cell-cell interactions by a dual tree traversal. A task-based threading model is used...
  • AFOPT

  • Referenced in 4 articles [sw18901]
  • conditional database construction strategy; and (4) tree traversal strategy. They adopted different strategies on these...
  • SPLITT

  • Referenced in 2 articles [sw31616]
  • SPLITT: Serial and Parallel LIneage Traversal of Trees. SPLITT is a one-header C++ library ... order and post-order traversal algorithms over tree-like data. The library is written ... and/or vectorized instructions to execute the tree traversal in parallel...
  • Pinktoe

  • Referenced in 2 articles [sw25858]
  • pinktoe: Semi-automatic Traversal of Trees. tree based methods in S or R are extremely ... variable description is complex the decision tree diagram is often not enough. This article describes ... tools to assist with the semiautomatic traversal of trees. The PT tool creates a widget...
  • LCM

  • Referenced in 41 articles [sw40293]
  • main theoretical contribution is that we construct tree-shaped transversal routes composed of only frequent ... defined on frequent closed item sets. By traversing the route in a depth-first manner...
  • data.tree

  • Referenced in 2 articles [sw40355]
  • tree structures from hierarchical data, and traverse the tree in various orders. Aggregate, cumulate, print...
  • SSAX

  • Referenced in 1 article [sw23631]
  • control pattern of the depth-first tree traversal. SXML is an abstract syntax tree...
  • hmglib

  • Referenced in 1 article [sw32904]
  • techniques like parallel tree traversal, space filling curves and batched operations are applied...
  • Juggrnaut

  • Referenced in 1 article [sw13410]
  • trees, and the Deutsch-Schorr-Waite tree traversal algorithm...
  • DICE

  • Referenced in 2 articles [sw02641]
  • search strategies, to traverse these search trees. DICE is implemented using the Manifold coordination language...
  • Cosmos++

  • Referenced in 5 articles [sw16653]
  • fully threaded oct-tree (in three dimensions) network to traverse the grid hierarchy across levels...
  • ARGENT

  • Referenced in 3 articles [sw03148]
  • procedure is based on backtrack traversal of the generation tree, where each node corresponds...
  • APT

  • Referenced in 3 articles [sw29303]
  • conjunctions and disjunctions. This tree represents the search space traversed by the program ... program. The nodes of the tree can be used to display information regarding the state...
  • RRB vector

  • Referenced in 1 article [sw19995]
  • Relaxed-Radix-Balanced (RRB) tree structure, which allows efficient structural reorganization, and (2) an optimization ... order to offset the cost of traversing the tree. In our benchmarks, the RRB-Vector...
  • SXSLT

  • Referenced in 3 articles [sw02365]
  • first rewriting system over abstract XML syntax trees, implemented as a library extension of Scheme ... writing “templates”, first-class stylesheets, flexible traversal strategies ... ability to re-traverse the original or the transformed trees. The language can emulate XSLT...
  • Algorithm 967

  • Referenced in 6 articles [sw23693]
  • space-filling curves, locally essential trees, and a hypercube-like communication scheme developed previously ... present new near and far interaction traversals that optimize cache usage. Also, unlike particle ... codes, we need a 2:1 balanced tree to allow for precomputations. We present...
  • TwigStack+

  • Referenced in 1 article [sw18907]
  • information can be got by traversing the whole tree structure using a twig pattern query...
  • TreeSwift

  • Referenced in 1 article [sw32580]
  • sizes grow, parsing and manipulating ultra-large trees becomes impractical for these tools. To address ... massively scalable Python package for traversing and manipulating trees that is ideal for algorithms performed...
  • RTEHunter

  • Referenced in 0 articles [sw25376]
  • builds a tree, called a symbolic execution tree, composed of all the possible execution paths ... RTEHunter detects runtime issues by traversing the symbolic execution tree and if a certain condition ... states, maximum depth of the symbolic execution tree and search strategy in order to find ... developed two novel search strategies for traversing the tree based on the number of null...