Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Tree Traversal"”.

  1. Automatically Optimizing Tree Traversal Algorithms

    … and traverse complex data structures like trees and graphs. As irregular applications operate on ever larger datasets, their performance suffers from poor locality and parallelism. Programmers are burdened with the arduous task of manually tuning such applications for better performance. …

    purdue-thes Repository record for Automatically Optimizing Tree Traversal Algorithms (opens in a new tab)

  2. Faster XML query processing using path index

    … evaluate queries. For XML documents modelled by tree structures, the retrieval of data requires substantial tree traversals. Thus, the fundamental differences between query processors are the organisation of the structural summary leading to the extent of the search space reduction, and the …

    uvic Repository record for Faster XML query processing using path index (opens in a new tab)

  3. Sequencing geographical data for efficient query processing on air in mobile computing.

    … optimization methods. The results show that R-Tree traversal ordering heuristic in conjunction with the optimization methods is effective for sequencing point data for spatial range query processing, while graph partition tree traversal ordering heuristic in conjunction with the optimization …

    oklahoma-thes Repository record for Sequencing geographical data for efficient query processing on air in mobile computing. (opens in a new tab)

  4. Accelerating Tree-Based Irregular Applications by Exploiting SIMD Parallelism

    Tree structures are one of the most pervasive data structures. Many tree-based applications feature abundant amount of data level parallelism (DLP), and modern SIMD architectures, such as GPUs and the SIMD instruction extension to CPUs, appear well-suited. However, due to the high irregularity in …

    unsw Repository record for Accelerating Tree-Based Irregular Applications by Exploiting SIMD Parallelism (opens in a new tab)

  5. The slicing extent technique for fast ray tracing

    … objects’ locations and orientations. Unlike oct-tree and other space-partitioning methods, SET is not primarily concerned with dividing space into mutually exclusive volume elements (‘voxels’) and identifying objects within each voxel. Instead, SET is based on analysis of projections of objects …

    ucf Repository record for The slicing extent technique for fast ray tracing (opens in a new tab)

  6. Refinement Acting vs. Simple Execution Guided by Hierarchical Planning

    … novel HTN planning algorithm that uses iterative tree traversal to refine HTNs. We also develop a purely reactive HTN acting algorithm using a similar procedure. Preserving the hierarchy in HTN plans can be helpful during execution. We make use of this fact to develop an algorithm for integrated …

    maryland Repository record for Refinement Acting vs. Simple Execution Guided by Hierarchical Planning (opens in a new tab)

  7. Differential Privacy for Nearest Neighbor Queries

    … is general to many applications and is based on tree data-structures and traversal. The biggest challenge with existing local differential private solutions is poor utility, requiring the addition of a restriction on the sensitivity of queries. We provide two variations, one which uses a similar …

    waterloo Repository record for Differential Privacy for Nearest Neighbor Queries (opens in a new tab)

  8. Improving dual-tree algorithms

    … body of work is entirely centered around dual-tree algorithms, a class of algorithm based on spatial indexing structures that often provide large amounts of acceleration for various problems. This work focuses on understanding dual-tree algorithms using a new, tree-independent abstraction, and …

    gatech Repository record for Improving dual-tree algorithms (opens in a new tab)

  9. 3-D Coverage Path Planning for Underwater Terrain Mapping

    … of underwater terrain using multi-level coverage trees. An autonomous underwater vehicle (AUV) equipped with multi-beam sonar sensors, Doppler velocity log (DVL) and inertial measurement unit (IMU) sensors is used to achieve this goal. The underwater 3-D search space is represented by a …

    uconn-diss Repository record for 3-D Coverage Path Planning for Underwater Terrain Mapping (opens in a new tab)

  10. Partitioned rendering infrastructure for stable accordion navigation

    … our generic infrastructure, I benchmark our tree comparison application with the performance of TreeJuxtaposer, a previous accordion drawing application with identical features. I describe our tree traversal algorithms, which we use for efficient rendering, culling, and layout of tree …

    ubc Repository record for Partitioned rendering infrastructure for stable accordion navigation (opens in a new tab) Download PDF for Partitioned rendering infrastructure for stable accordion navigation (opens in a new tab)

  11. Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching

    … size, and gradation. Fully Anisotropic Split-Tree Adaptive Refinement (FASTAR) is a code that allows the user to exert a great deal of control and ultimately generate a valid, geometry conforming mesh. Due to the split-tree nature and the use of volumetric pixels (voxels), non-unit aspect …

    utc Repository record for Fully anisotropic split-tree adaptive refinement mesh generation using tetrahedral mesh stitching (opens in a new tab)

  12. Construction of a Generic Program Representation for Automated Metric Computation

    … tools to produce a generalized abstract syntax tree that captures the important syntactic categories required for metric computation. To demonstrate the utility of our approach, we exploit front-end parser tools for the Python and C++ programming languages to produce a generalized abstract …

    clemson Repository record for Construction of a Generic Program Representation for Automated Metric Computation (opens in a new tab)

  13. Development of an AMR Octree DSMC approach for shock dominated flows

    … program are described. The code employs an Octree based adaptive mesh refinement (AMR) that gives flexibility in capturing multi-scale physics. It is coupled with a robust cut-cell algorithm to incorporate complex triangulated geometries. With the use of distributed memory systems and …

    uiuc Repository record for Development of an AMR Octree DSMC approach for shock dominated flows (opens in a new tab)

  14. Bonsai Merkle Tree Streams: Bulk Memory Verification Unit for Trusted Program Verification System

    … by using a small dedicated cache and efficient tree traversal techniques to asynchronously verify large chunks of program memory in stream-like fashion. This thesis primarily serves to provide a design, proof-of-concept, and collection of important information that will help future students …

    calpoly Repository record for Bonsai Merkle Tree Streams: Bulk Memory Verification Unit for Trusted Program Verification System (opens in a new tab)

  15. Routing protocols for ad hoc networks with uncertainty in the position of the destination

    … two approaches to this problem: one, based on a traversal of the faces of a planar sub-graph of the graph representing the network, and the second, based on flooding a limited area of the graph that represents the region the destination is likely to be found. We propose several variants of both …

    concordia Download PDF for Routing protocols for ad hoc networks with uncertainty in the position of the destination (opens in a new tab)

  16. Methods and models for the quantitative analysis of crowd brainstorming

    … quantity and novelty. They are constructed via a tree-traversal algorithm, restricting the subset of the corpus which the coder must be aware of when making decisions. A simulation approach is introduced to assess the validity of hypothesis outcomes derived from idea forest metrics. The …

    waterloo Repository record for Methods and models for the quantitative analysis of crowd brainstorming (opens in a new tab)

  17. GPU-parallelisation and integration of multiwavelet grid adaptation for fast discontinuous Galerkin modelling of multiscale flooding on LISFLOOD-FP

    … -- a Z-order space-filling curve, a parallel tree traversal algorithm and an array data structure -- to redesign its algorithmic structure and thereby enable its implementation on the GPU. After assessing the extent to which the proposed computational ingredients indeed allow for an efficient …

    whiterose Download PDF for GPU-parallelisation and integration of multiwavelet grid adaptation for fast discontinuous Galerkin modelling of multiscale flooding on LISFLOOD-FP (opens in a new tab)

  18. Recursive Hyperspheric Classification

    … of hyperspheres, or balls. Utilizing standard tree traversal algorithms, hyperspheres are generated, partitioning and classifying the rich feature space. Once mapped, the resulting taxonomic data structure may be used to recognize unlabeled vectors in the search space as well as provide …

    unr Repository record for Recursive Hyperspheric Classification (opens in a new tab)

  19. Automatic Algorithm Recognition Based on Programming Schemas and Beacons - A Supervised Machine Learning Classification Approach

    … We use the C4.5 algorithm to generate a decision tree that performs the task. In the second method, the schema detection method, algorithms are defined as schemas that exist in the knowledge base of the system. To identify an algorithm, the method searches the source code to detect schemas that …

    aalto Repository record for Automatic Algorithm Recognition Based on Programming Schemas and Beacons - A Supervised Machine Learning Classification Approach (opens in a new tab)

Page 1 of 2