Results 151 to 160 of about 5,839 (198)
High-performance fault-tolerant quantum computing with many-hypercube codes. [PDF]
Sci AdvGoto H.
europepmc +1 more source
MOCLIP: a foundation model for large-scale nanophotonic inverse design. [PDF]
Nat CommunRodionov S +5 more
europepmc +1 more source
Hyperspectral Imaging for Identifying Foreign Objects on Pork Belly. [PDF]
Sensors (Basel)Ghimpeteanu G +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1992 A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same ...
L M Patnaik
exaly +3 more sources
Symmetry, 2023 We obtain a large number of degree and distance-based topological indices, graph and Laplacian spectra and the corresponding polynomials, entropies and matching polynomials of n-dimensional hypercubes through the use of Hadamard symmetry and recursive ...
Krishnan Balasubramanian
exaly +2 more sources
Networks, 2002
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +4 more sources
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +4 more sources
IEEE Transactions on Computers, 1988
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
exaly +2 more sources
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
exaly +2 more sources
Graphs and Combinatorics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Axenovich +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Axenovich +4 more
openaire +1 more source