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 97 for “"Tree structure"”.
-
Finding program differences based on syntactic tree structure
Programmers look at differences between versions of a program to gain information about the program and changes to it. Despite the wide application of syntactic and semantic analysis to other areas, similar analysis has not been applied to finding program differences.
-
Latent tree structure learning for cross-document coreference resolution
… the CDCR problem by first turning it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned …
-
Implementation of a testing and initialization algorithm for the generalized tree structure
… multiple stuck-at faults occurring within the structure of a generalized tree using, as the testing machines, a set of generalized sequential trees. It is shown that the testing machine can be implemented on a set of trees of the same depth as that of the tree which is being tested. …
-
A Comparative Study of Tree Structure and Composition of a mixed Coniferous Forest and Sequoia Groves in Sequoia National Park, California
<p>Forest structure in the giant sequoia grove and in the surrounding mixed coniferous forest is dominated by Abies concolor. The large basal area of Sequoiadendron giganteum is significant within the grove in terms of relative dominance but does not offset the density of Abies concolor which …
-
Multi-spectral light interaction modeling and imaging of skin lesions
… Information about the lesion depth and its structure will further improve the sensitivity and specificity of melanoma diagnosis. Wavelength-dependent variable penetration power of monochromatic light in the trans-illumination imaging using the Nevoscope can be used to obtain this …
-
An Empirical Study on Sum-Product Networks Structure Learning and Deep Convolutional Sum-Product Networks
… that implementing SPN leaf nodes as Chow-Liu Trees (CLTs) yields more accurate SPNs for the former pair. Our experiments show the same for the latter pair, and that neither pair dominates the other. Lastly, we report an analysis of SPN topology for unstudied pairs. Deep convolutional …
-
Digital Watermarking Based Image and Video Quality Evaluation
… computational complexity. As an improvement, a tree structure based scheme is proposed to assign adaptive watermark embedding strengths by pre-estimating the signal degradation characteristics, which greatly improves the computational efficiency. The SPIHT tree structure and HVS masking are used …
-
NEW ALGORITHMS FOR COMPRESSED SENSING OF MRI: WTWTS, DWTS, WDWTS
… prior approach by utilizing the entire wavelet tree structure as an argument for coefficient correlation and also considers the directionality of wavelet coefficients using Hybrid Directional Wavelets (HDW). Incorporating coefficient thresholding in both wavelet tree structure as well as …
-
Recognition of aerospace acoustic sources using advanced pattern recognition techniques
… set of unknown data. Two different classifier structures were tested, a single level structure and a tree structure. Results show that the single level associative memory and artificial neural network classifiers each identified 90.6 percent of the acoustic sources correctly. The original …
-
A paging scheme for pointer-based quadtrees
The quadtree is a family of data structures that organize spatial data using recursive subdivision. A pointer-based quadtree uses an explicit tree structure to represent the subdivision, while a linear quadtree holds a sorted list of records corresponding to the leaves of the tree structure. Small …
-
Product grammar : construction and exploring solution spaces
… place to integrate components into the product structure. What results is a complex tree structure of the possible solutions that can be optimized to ergonomic, structural, aerodynamic, manufacturing and material perspectives. The tree structure is organized so that any changes in the component …
-
Visualizing the conversation pathways of telephone linked care in a directed graph
… order in which these questions are asked, a tree structure will reveal the conversational paths that are taken in the calls. By combining data from multiple calls and encoding them in this tree structure, new insights can be gained into the TLC data. For example, the frequency with which …
-
Self-organizing Bluetooth scatternets
… online topology formation algorithm, called TSF (Tree Scatternet Formation), builds scatternets by connecting nodes into a tree structure that simplifies packet routing and scheduling. Unlike earlier works, our design does not restrict the number of nodes in the scatternet, and also allows nodes …
-
Latent Compositional Representations for English Function Word Comprehension
… whether biasing natural language models toward tree-compositional structure and systematic token representation can improve performance on tasks that require the use of function words. The method used treats tree-structure as latent and thus requires no gold parse labels. Results show that …
-
Creation of an Instructional Animation Showing the Development of the Human Placenta from Implantation to Term
… representations of placental villous tree structure. This animation provides an overview of placental development and includes a three-dimensional depiction of a placental villous tree. Following creation of this animation, a survey was administered to assess the helpfulness of both …
-
Exploiting syntactic relations for question answering
… information but still ignoring most of the tree structure. This thesis describes the design and implementation of SMARTQA, a proof-of-concept question answering system that compares syntactic trees in a principled manner. Specifically, SMARTQA uses a tree edit-distance algorithm to calculate …
-
Information-theoretic Algorithms for Model-free Reinforcement Learning
… algorithm combines the Lempel-Ziv (LZ) parsing tree structure for states introduced in [4] together with the optimistic Q-learning approach in [9]. We mathematically analyze the algorithm towards showing sublinear regret, providing major steps towards the proof of such. In doing so, we reduce …
-
Comparison and performance enhancement of modern pattern classifiers
… the classes of a multi-class problem in a tree structure for fast classification. The former is crucial, as dataset sizes are known to have increased rapidly, and the straightforward training using quadratic programming over all of the given data is prohibitively expensive. While some …
-
Decoding algorithms using side-effect machines
… use multiple side effect machines to create a tree structure of subclassification. The goal is to examine these techniques and provide new decoders for existing codes. Presented are ideas for best practices for the creation of these two types of new edit metric decoders.
Page 1 of 5