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 122 for “"Binary Tree"”.

  1. Binary tree classifier and context classifier

    … classifier are discussed in this paper, one is a binary decision tree classifier based on the Fisher's linear discriminant function as a decision rule at each nonterminal node, and the other is a contextual classifier which gives each pixel the highest probability label given some substantially …

    vt Repository record for Binary tree classifier and context classifier (opens in a new tab)

  2. Binary tree structures for matrix multiplication

    Thesis (M.S.)--Michigan State University. Department of Electrical Engineering and Systems Science, 1983

    msu Repository record for Binary tree structures for matrix multiplication (opens in a new tab)

  3. Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers

    Two applications of a binary tree data type based on a simple pairing function (a bijection between natural numbers and pairs of natural numbers) are explored. First, the tree is used to encode natural numbers, and algorithms that perform basic arithmetic computations are presented along with …

    unt Repository record for Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers (opens in a new tab)

  4. Performance Analysis of a Binary-Tree-Based Algorithm for Computing Spatial Distance Histograms

    … density map which is implemented via a quad tree index. An algorithm having density maps implemented via binary tree is proposed in this thesis. After carrying out many experiments and analysis of the data, we figure out that although the binary tree approach seems efficient in earlier stage, …

    usf Repository record for Performance Analysis of a Binary-Tree-Based Algorithm for Computing Spatial Distance Histograms (opens in a new tab)

  5. Asymptotic completeness via Mourre theory of a Schrödinger operator on a binary tree grap

    … Hamiltonian H = L + Q is shown to hold for a binary tree configuration space, where L is the discrete Laplacian and Q a discrete potential either of short-range type or of long-range type satisfying a first order difference condition. In the last chapter the result from chapter three as well …

    ubc Repository record for Asymptotic completeness via Mourre theory of a Schrödinger operator on a binary tree grap (opens in a new tab) Download PDF for Asymptotic completeness via Mourre theory of a Schrödinger operator on a binary tree grap (opens in a new tab)

  6. Self-stabilizing binary search tree maintenance algorithm

    Binary search tree is one of the most studied data structures. The main application of the binary search tree is in implementing efficient search operations. A binary search tree is a special binary tree which satisfies the property that for every processor p in the binary tree, the values of all …

    unlv Repository record for Self-stabilizing binary search tree maintenance algorithm (opens in a new tab) Download PDF for Self-stabilizing binary search tree maintenance algorithm (opens in a new tab)

  7. Algorithm to Compute Reduced Costs on a Graph

    … fundamental path on the corresponding spanning tree. A new algorithm for this problem is proposed. It is based on the construction of a Binary Tree by sequential deletion of arcs in a descending order of costs. The tree is composed of leaf nodes representing the actual vertices in the graph and …

    city-london Download PDF for Algorithm to Compute Reduced Costs on a Graph (opens in a new tab)

  8. Simulation of Various Networks on Fibonacci Cube Network Topology

    … [28]. In this paper we investigate embeddings of Binary Tree, X-Tree, Arbitrary Binary Tree, Linear Arrays, 2-D Mesh and Ring interconnection networks. The embeddings discussed show that Fibonacci Cube network can efficiently simulate them. They are, in fact, optimum or nearly optimum in both …

    sdstate Repository record for Simulation of Various Networks on Fibonacci Cube Network Topology (opens in a new tab)

  9. A code excited linear predictive coder: using a moments algorithm

    … algorithm. These indices were stored on a Graded Binary Tree. A Binary Search was then used to select the correct index. The use of a Graded Binary Tree in the coding algorithm reduced the search time. The algorithm faithfully reproduced the original speech when the test residual error signal was …

    dcu Download PDF for A code excited linear predictive coder: using a moments algorithm (opens in a new tab)

  10. Interconnection Network Design and Simulation

    … its diameter is reduced by half. The complete binary tree is another important interconnection network, because it captures the essence of the divide and conquer algorithm. The pointer jumping technique is a widely used paradigm in parallel processing, particularly in the PRAM algorithm design. …

    sdstate Repository record for Interconnection Network Design and Simulation (opens in a new tab)

  11. Routing, Driven Placement for ATMEL 6000 Architecture FPGAs

    Based on the concept of Cell Binary Tree (CBT), a new technique for mapping combination circuits into ATMEL 6000 Architecture FPGAs is presented in this thesis. Cell Binary Tree (CBT) is a net-list representation of combinational circuits. For each node of CBT there is a distinguished variable …

    portland-state Repository record for Routing, Driven Placement for ATMEL 6000 Architecture FPGAs (opens in a new tab)

  12. Fast Parallel Algorithms for Basic Problems

    … and multiple selection, and reconstruction of a binary tree from its traversals. The research on priority queue was motivated by its various applications. The purpose of studying multiple search and multiple selection is to explore the relationships between four of the most fundamental problems …

    odu Repository record for Fast Parallel Algorithms for Basic Problems (opens in a new tab)

  13. Throughput performance of tree collision resolution algorithms with capture

    The effect of capture on tree algorithms in a slotted ALOHA broadcasting network is investigated. Two receiver models are considered: Feedback With Capture (FWC) and Feedback Without Capture (FWOC). In FWC, the receiver is able to distinguish between a success and capture slot, whereas in FWOC it …

    ubc Repository record for Throughput performance of tree collision resolution algorithms with capture (opens in a new tab) Download PDF for Throughput performance of tree collision resolution algorithms with capture (opens in a new tab)

  14. An Investigation and Implementation of Some Binary Search Tree Algorithms

    … documents the results of an investigation into binary search trees. Because of their favourable characteristics binary search trees have become popular for information storage and retrieval applications in a one level store. The trees may be of two types, weighted and unweighted. Various …

    mcmaster Repository record for An Investigation and Implementation of Some Binary Search Tree Algorithms (opens in a new tab)

  15. A data structure for interactive graphic manipulation of logic diagrams

    … system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with recommendations for …

    vt Repository record for A data structure for interactive graphic manipulation of logic diagrams (opens in a new tab)

  16. Finding Paths in the Rotation Graph of Binary Trees

    A binary tree coding scheme is a bijection mapping a set of binary trees to a set of integer tuples called codewords. One problem considered in the literature is that of listing the codewords for n-node binary trees, such that successive codewords represent trees differing by a single rotation, a …

    ucf Repository record for Finding Paths in the Rotation Graph of Binary Trees (opens in a new tab)

  17. Multiple Fundamental Frequency Pitch Detection for Real Time MIDI Applications

    … frequencies). The first classification uses a binary decision tree that determines the root note (first note) in a combination of notes; this is achieved through a neural network binary classifier. For each leaf of the binary tree, each classifier determines the frequency group of the root note …

    vcu Repository record for Multiple Fundamental Frequency Pitch Detection for Real Time MIDI Applications (opens in a new tab)

Page 1 of 7