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 511 for “"Hypercube"”.

  1. Efficient hypercube communications

    <p>Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending a message from one node to another, broadcasting a message from one node to all others, broadcasting a message from each node to all others, all-to-all personalized communication, one-to-all …

    njit Repository record for Efficient hypercube communications (opens in a new tab)

  2. Hypercube solutions for conjugate directions.

    … communication-in both cases-was borne by a hypercube interconnection topology. The results reveal general findings from parallel computing and more specific data and information concerning the systems and algorithms that were employed. Communication is timed and the results are analyzed, …

    nps Repository record for Hypercube solutions for conjugate directions. (opens in a new tab)

  3. The Folded Hypercube ATM Switches

    … three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. The major performance parameters measured are the cell loss rate and cell delay time through the switch under uniform, normal, and …

    vt Repository record for The Folded Hypercube ATM Switches (opens in a new tab)

  4. Induction by a Hilbert hypercube representation

    … machine utilizing induction by a Hilbert hypercube representation. This representation offers a number of distinct advantages which are described. We construct a theoretical and practical learning machine which lies in an area of overlap between three disciplines - neural nets, machine …

    aston Download PDF for Induction by a Hilbert hypercube representation (opens in a new tab)

  5. Spectral graph theory of the Hypercube

    … graph. Here we explore these two areas for the hypercube Qn, which is formed recursively by taking the Cartesian product of Qn-1 with the complete graph on two vertices, K2. We analyze and compare several key ideas from the inverse eigenvalue problem for Qn, including the maximum multiplicity of …

    nps Repository record for Spectral graph theory of the Hypercube (opens in a new tab)

  6. The Subconstituent Algebra of a Hypercube

    We study the hypercube and the associated subconstituent algebra. Let Q_D denote the hypercube with dimension D and let X denote the vertex set of Q_D. Fix a vertex x in X. We denote by A the adjacency matrix of Q_D and by A* = A*(x) the diagonal matrix with yy-entry equal to D − 2i, where i is the …

    unf Repository record for The Subconstituent Algebra of a Hypercube (opens in a new tab) Download PDF for The Subconstituent Algebra of a Hypercube (opens in a new tab)

  7. Deflection routing in buffered binary hypercube switches

    … candidate for future B- switches. Binary hypercubes have regular topology, are highly fault and have multiple paths for routing cells which help avoid performance penalties due to congestion and faults. In addition, these switches can adopt the novel, distributed, and adaptive routing …

    sask Repository record for Deflection routing in buffered binary hypercube switches (opens in a new tab)

  8. ALGORITHMS FOR PACKET ROUTING IN GENERALIZED HYPERCUBE

    greece Repository record for ALGORITHMS FOR PACKET ROUTING IN GENERALIZED HYPERCUBE (opens in a new tab)

  9. Parallel homotopy curve tracking on a hypercube

    … system solving algorithms on a hypercube, in the context of parallel homotopy algorithms for problems with small, dense Jacobian matrices. This study also examines the effect of different component complexity distributions and the size of the Jacobian matrix on the different …

    vt Repository record for Parallel homotopy curve tracking on a hypercube (opens in a new tab)

  10. Hypercube coloring and the structure of binary codes

    … combinatorial object, the k-dimensional hypercube, Qk. The hypercube itself is 2-colorable for all k; however, coloring the square of the cube is a much more interesting problem. This is the graph in which the vertices are binary vectors of length k, and two vertices are adjacent if and …

    ubc Repository record for Hypercube coloring and the structure of binary codes (opens in a new tab) Download PDF for Hypercube coloring and the structure of binary codes (opens in a new tab)

  11. Structure for algorithms, graph reconstruction and hypercube intersections

    … to the study of intersection patterns in the hypercube. We investigate the possible intersection sizes a k-dimensional linear subspace can have with the hypercube {0,1}<sup>n</sup>. For fixed k and arbitrary n, the intersection size must be between 1 and 2<sup>k</sup>. We exactly determine the …

    oxford Repository record for Structure for algorithms, graph reconstruction and hypercube intersections (opens in a new tab)

  12. Investigation and Applications of Latin Hypercube Sampling Methods

    The Latin hypercube sampling method, sometimes called the stratified sampling method, is a commonly used variance reduction method. Recently, the optimal Latin hypercube sampling method (OLH) and the modified optimal Latin hypercube sampling method (MOLH) are introduced in the literature, which use …

    odu Repository record for Investigation and Applications of Latin Hypercube Sampling Methods (opens in a new tab)

  13. Hypercube diagrams for knots, links, and knotted tori

    … is a generalization of cube diagrams, called hypercube diagrams. We use such diagrams, which represent immersed Lagrangian tori in R^4 to study embedded Legendrian tori in the standard contact space. We then show how to compute one of the classical invariants, the rotation class, and discuss …

    lsu-thes Repository record for Hypercube diagrams for knots, links, and knotted tori (opens in a new tab)

  14. Translation of images on the hypercube using leaf codes

    … from simulation of these algorithms for a hypercube parallel computing system. Simulation results are obtained for a single pixel and multiple pixels per processing element (PE) of a hypercube parallel computing system. In the case where multiple pixels are stored in each PE, a binary image …

    njit Repository record for Translation of images on the hypercube using leaf codes (opens in a new tab)

  15. Performance analysis of pyramid mapping algorithms for the hypercube

    … map pyramids and multilevel structures onto the hypercube are presented. The pyramid structure is appropriate for low-level and intermediate-level computer vision algorithms. It is not only efficient for the support of both local and global operations but also capable of supporting the …

    njit Repository record for Performance analysis of pyramid mapping algorithms for the hypercube (opens in a new tab)

  16. Shortest Path Routing on the Hypercube with Faulty Nodes

    … topologies for interconnection networks and the hypercube is one of the most popular networks. There are a variety of different routing paradigms that need to be investigated on the hypercube. In this thesis we investigate the shortest path routing between two nodes on the hypercube when some …

    brock Repository record for Shortest Path Routing on the Hypercube with Faulty Nodes (opens in a new tab)

Page 1 of 26