Relevant bibliographies by topics / Hypercubes

Academic literature on the topic 'Hypercubes'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hypercubes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hypercubes"

1

Röttger, Markus, and Ulf-Peter Schroeder. "Embedding 2-Dimensional Grids Into Optimal Hypercubes with Edge-Congestion 1 or 2." Parallel Processing Letters 08, no. 02 (June 1998): 231–42. http://dx.doi.org/10.1142/s0129626498000249.

Full text
Abstract:
This paper explores one-to-one embeddings of 2-dimensional grids into hypercubes. It is shown that each 2-dimensional grid can be embedded with edge-congestion 2 into its optimal hypercube (the smallest hypercube with at least as many nodes as the grid). Additionally, a technique is developed to embed many 2-dimensional grids into their optimal hypercubes with edge-congestion 1.
APA, Harvard, Vancouver, ISO, and other styles
2

ZIAVRAS, SOTIRIOS G. "SCALABLE MULTIFOLDED HYPERCUBES FOR VERSATILE PARALLEL COMPUTERS." Parallel Processing Letters 05, no. 02 (June 1995): 241–50. http://dx.doi.org/10.1142/s0129626495000229.

Full text
Abstract:
This paper introduces the family of scalable multifolded hypercube (SMH) architectures for parallel computers. Scalability and versatility at resonable cost are the major characteristics of these architectures. SMHs perform comparable to generalized hypercubes for important classes of algorithms that use regular communication patterns. In addition, they often achieve better performance than the popular direct binary hypercubes because they can emulate efficiently a powerful family of multifolded direct binary hypercubes. Extensive comparison of cost with binary and generalized hypercubes is also included. The hardware cost of SMH's is shown to be even lower than that of fat trees. Therefore, SMH's are viable candidates for the construction of versatile parallel computers.
APA, Harvard, Vancouver, ISO, and other styles
3

Burkov, Andriy, and Brahim Chaib-draa. "An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 729–36. http://dx.doi.org/10.1609/aaai.v24i1.7623.

Full text
Abstract:
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a single hypercube approximation of the set of SPE payoff profiles. Then the initial hypercube is gradually partitioned on to a set of smaller adjacent hypercubes, while those hypercubes that cannot contain any SPE point are gradually withdrawn. Whether a given hypercube can contain an equilibrium point is verified by an appropriate mixed integer program. A special attention is paid to the question of extracting players' strategies and their representability in form of finite automata.
APA, Harvard, Vancouver, ISO, and other styles
4

HUANG, KE, and JIE WU. "AREA EFFICIENT LAYOUT OF BALANCED HYPERCUBES." International Journal of High Speed Electronics and Systems 06, no. 04 (December 1995): 631–45. http://dx.doi.org/10.1142/s0129156495000237.

Full text
Abstract:
As a multicomputer structure, the balanced hypercube is a variant of the standard hypercube for multicomputers, with desirable properties of strong connectivity, regularity, and symmetry. This structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. In this paper, we study the implementation of balanced hypercubes in VLSI using the Wafer Scale Integration (VLSI/WSI) technology. Emphasis is on VLSI/WSI layout and area estimates. Our results show that the balanced hypercube can be implemented at least as efficient as the standard hypercube in an area layout and more efficient in a linear layout.
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Jin S., Seung Ryoul Maeng, and H. Yoon. "Ring Embedding in Hypercubes with Faculty Nodes." Parallel Processing Letters 07, no. 03 (September 1997): 285–96. http://dx.doi.org/10.1142/s0129626497000309.

Full text
Abstract:
Hypercube is an attractive structure for parellel processing due to its symmetry and regularity. To increase the reliability of hypercube based systems and to allow their use in the presence of faulty nodes, efficient fault-tolerant schemes in hypercubes are necessary. In this paper, we present an algorithm for embedding rings in hypercubes based multiprocessor network in the event of node failures. The algorithm can tolerate up to θ(2n/2) faults, and guarantee that given any f < (n - 2k)2k faulty nodes, it can find a ring of size at least 2n - 2f for k = 0 and 2n - 2k f - 22k for k ≥ 1 in an n-dimensional hypercube. It improves over existing algorithms in the size of ring.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Jia-Bao, Xiang-Feng Pan, and Jinde Cao. "Some Properties on Estrada Index of Folded Hypercubes Networks." Abstract and Applied Analysis 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/167623.

Full text
Abstract:
LetGbe a simple graph withnvertices and letλ1,λ2,…,λnbe the eigenvalues of its adjacency matrix; the Estrada indexEEGof the graphGis defined as the sum of the termseλi, i=1,2,…,n. Then-dimensional folded hypercube networksFQnare an important and attractive variant of then-dimensional hypercube networksQn, which are obtained fromQnby adding an edge between any pair of vertices complementary edges. In this paper, we establish the explicit formulae for calculating the Estrada index of the folded hypercubes networksFQnby deducing the characteristic polynomial of the adjacency matrix in spectral graph theory. Moreover, some lower and upper bounds for the Estrada index of the folded hypercubes networksFQnare proposed.
APA, Harvard, Vancouver, ISO, and other styles
7

LATIFI, SHAHRAM. "SUBCUBE EMBEDDABILITY OF FOLDED HYPERCUBES." Parallel Processing Letters 01, no. 01 (September 1991): 43–50. http://dx.doi.org/10.1142/s0129626491000203.

Full text
Abstract:
The Folded Hypercube (FHC) has been proven to be an attractive hypercube-based network. This paper closely compares the FHC to its standard hypercube counterpart from the subcube allocation viewpoint. It is shown that the FHC(n) outperforms the n-dimensional hypercube (n-cube for short) in offering subcubes of size k by a factor of [Formula: see text]. In an environment where subcubes of the original network must be allocated to incoming tasks, the FHC achieves an excellent processor utilization by assigning subcubes in an efficient and compact manner. Using the concept of virtual hypercubes, an efficient way is suggested to recognize the available subcubes in the FHC by adapting the already developed subcube recognition algorithms. An alternative approach to the subcube recognition problem is also given.
APA, Harvard, Vancouver, ISO, and other styles
8

Klavžar, Sandi. "Counting hypercubes in hypercubes." Discrete Mathematics 306, no. 22 (November 2006): 2964–67. http://dx.doi.org/10.1016/j.disc.2005.10.036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

BEST, ANA, MARKUS KLIEGL, SHAWN MEAD-GLUCHACKI, and CHRISTINO TAMON. "MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES." International Journal of Quantum Information 06, no. 06 (December 2008): 1135–48. http://dx.doi.org/10.1142/s0219749908004377.

Full text
Abstract:
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the hypercube with an additive matching x ↦ x ⊕ η is instantaneous uniform mixing whenever |η| is even, but with a slower mixing time. This strictly includes the result of Moore and Russell1 on the hypercube. • The class of Hamming graphs H(n,q) is not uniform mixing if and only if q ≥ 5. This is a tight characterization of quantum uniform mixing on Hamming graphs; previously, only the status of H(n,q) with q < 5 was known. • The bunkbed graph [Formula: see text] whose adjacency matrix is I ⊗ Qn + X ⊗ Af, where Af is a [Formula: see text]-circulant matrix defined by a Boolean function f, is not uniform mixing if the Fourier transform of f has support of size smaller than 2n-1. This explains why the hypercube is uniform mixing and why the join of two hypercubes is not. Our work exploits the rich spectral structure of the generalized hypercubes and relies heavily on Fourier analysis of group-circulants.
APA, Harvard, Vancouver, ISO, and other styles
10

TEL, GERARD. "LINEAR ELECTION IN HYPERCUBES." Parallel Processing Letters 05, no. 03 (September 1995): 357–66. http://dx.doi.org/10.1142/s0129626495000333.

Full text
Abstract:
This article proposes an election algorithm for the hypercube; it exchanges less than [Formula: see text] messages and uses O( log 2 N) time (where N is the size of the cube). A randomized version of the algorithm achieves the same (expected) asymptotic message and time bounds, but uses messages of only O( log log N) bits and can be used in anonymous hypercubes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hypercubes"

1

John, Ajita. "Linearly Ordered Concurrent Data Structures on Hypercubes." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc501197/.

Full text
Abstract:
This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most [log₂ 𝑛] and a depth of [log₂ 𝑛] +1. Search trees spanning non-overlapping processor lists are formed using only local information, and can be used concurrently without contention problems. Thus, they can be used for performing broadcast and merge operations simultaneously on sets with non-uniform sizes. Extensions to generalized and faulty hypercubes and applications to image processing algorithms and for m-way search are discussed.
APA, Harvard, Vancouver, ISO, and other styles
2

潘忠強 and Chung-keung Poon. "Fault tolerant computing on hypercubes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1991. http://hub.hku.hk/bib/B31209944.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

White, William Warren. "Mapping parallel algorithms into hypercubes /." The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261010809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Johansson, Per. "Avoiding edge colorings of hypercubes." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863.

Full text
Abstract:
The hypercube Qn is the graph whose vertices are the ordered n-tuples of zeros and ones, where two vertices are adjacent iff they differ in exactly one coordinate. A partial edge coloring f of a graph G is a mapping from a subset of edges of G to a set of colors; it is called proper if no pair of adjacent edges share the same color. A (possibly partial and unproper) coloring f is avoidable if there exists a proper coloring g such that no edge has the same color under f and g. An unavoidable coloring h is called minimal if it would be avoidable by letting any colored edge turn noncolored. We construct a computer program to find all minimal unavoidable edge colorings of Q3 using up to 3 colors, and draw some conclusions for general Qn.
APA, Harvard, Vancouver, ISO, and other styles
5

Gurney, Kevin. "Learning in networks of structured hypercubes." Thesis, Brunel University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328877.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Smedley, Garth Peter. "Algorithms for embedding binary trees into hypercubes." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/27635.

Full text
Abstract:
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a parallel program to a multicomputer. The communication structure of the program is represented by G, the interconnection network of the multicomputer is represented by H and the goal is to embed G into H such that some measure of the communication cost is minimized. In general, this problem is N P-complete and several types of approximation algorithms have been proposed. We evaluate these algorithms empirically using hypercube host graphs and binary tree guest graphs. These families of graphs are interesting because of the existence of both heuristic techniques and theoretical algorithms for this problem. Although for general trees the problem is N P-complete, for binary trees the complexity remains open. We have implemented and experimented with several different algorithms and discovered variations of a greedy approach which produce close to optimal solutions in a reasonable amount of time.
Science, Faculty of
Computer Science, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
7

Aliakbarpour, Maryam. "Learning and testing junta distributions over hypercubes." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101578.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 77-80).
Many tasks related to the analysis of high-dimensional datasets can be formalized as problems involving learning or testing properties of distributions over a high-dimensional domain. In this work, we initiate the study of the following general question: when many of the dimensions of the distribution correspond to "irrelevant" features in the associated dataset, can we learn the distribution efficiently? We formalize this question with the notion of junta distribution. The distribution D over {0, 1}n is a k-junta distribution if the probability mass function p of D is a k-junta-- i. e., if there is a set J [subset][n] of at most k coordinates such that for every x [set membership] {0, 1}7, the value of p(x) is completely determined by the value of x on the coordinates in J. We show that it is possible to learn k-junta distributions with a number of samples that depends only logarithmically on the total number n of dimensions. We give two proofs of this result; one using the cover method and one by developing a Fourier-based learning algorithm inspired by the Low-Degree Algorithm of Linial, Mansour, and Nisan (1993). We also consider the problem of testing whether an unknown distribution is a k-junta distribution. We introduce an algorithm for this task with sample complexity Õ(2n/²k⁴) and show that this bound is nearly optimal for constant values of k. As a byproduct of the analysis of the algorithm, we obtain an optimal bound on the number of samples required to test a weighted collection of distribution for uniformity. Finally, we establish the sample complexity for learning and testing other classes of distributions related to junta-distributions. Notably, we show that the task of testing whether a distribution on {0, 1}n contains a coordinate i [set membership] [n] such that xi is drawn independently from the remaining coordinates requires [theta]](2²n/³) samples. This is in contrast to the task of testing whether all of the coordinates are drawn independently from each other, which was recently shown to have sample complexity [theta](2n/²) by Acharya, Daskalakis, and Kamath (2015).
by Maryam Aliakbarpour.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
8

Cairncross, Emily. "Proper 3-colorings of cycles and hypercubes." Oberlin College Honors Theses / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1621606265779497.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vasquez, Maria Rosario. "An investigation of super line graphs of hypercubes." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865951.

Full text
Abstract:
Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design, data structures, parallel computation, process scheduling and in a variety of other areas of computer science. Hypercubes are one of the preferred architectures for parallel computation, and a study of some properties of the hypercubes motivated this thesis.The concept of super line graphs, introduced by Bagga at el, generalizes the notion of line graphs. In this thesis several graph theoretic properties of super line graphs of hypercubes are studied. In particular the super line graphs of index two of hypercubes are investigated and some exact results and precise characterizations are found.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
10

Le, guiban Kaourintin. "Hypercubes Latins maximin pour l’echantillonage de systèmes complexes." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC008/document.

Full text
Abstract:
Un hypercube latin (LHD) maximin est un ensemble de points contenus dans un hypercube tel que les points ne partagent de coordonnées sur aucune dimension et tel que la distance minimale entre deux points est maximale. Les LHDs maximin sont particulièrement utilisés pour la construction de métamodèles en raison de leurs bonnes propriétés pour l’échantillonnage. Comme la plus grande partie des travaux concernant les LHD se sont concentrés sur leur construction par des algorithmes heuristiques, nous avons décidé de produire une étude détaillée du problème, et en particulier de sa complexité et de son approximabilité en plus des algorithmes heuristiques permettant de le résoudre en pratique.Nous avons généralisé le problème de construction d’un LHD maximin en définissant le problème de compléter un LHD entamé en respectant la contrainte maximin. Le sous-problème dans lequel le LHD partiel est vide correspond au problème de construction de LHD classique. Nous avons étudié la complexité du problème de complétion et avons prouvé qu’il est NP-complet dans de nombreux cas. N’ayant pas déterminé la complexité du sous-problème, nous avons cherché des garanties de performances pour les algorithmes résolvant les deux problèmes.D’un côté, nous avons prouvé que le problème de complétion n’est approximable pour aucune norme en dimensions k ≥ 3. Nous avons également prouvé un résultat d’inapproximabilité plus faible pour la norme L1 en dimension k = 2. D’un autre côté, nous avons proposé un algorithme d’approximation pour le problème de construction, et avons calculé le rapport d’approximation grâce à deux bornes supérieures que nous avons établies. En plus de l’aspect théorique de cette étude, nous avons travaillé sur les algorithmes heuristiques, et en particulier sur la méta-heuristique du recuit simulé. Nous avons proposé une nouvelle fonction d’évaluation pour le problème de construction et de nouvelles mutations pour les deux problèmes, permettant d’améliorer les résultats rapportés dans la littérature
A maximin Latin Hypercube Design (LHD) is a set of point in a hypercube which do not share a coordinate on any dimension and such that the minimal distance between two points, is maximal. Maximin LHDs are widely used in metamodeling thanks to their good properties for sampling. As most work concerning LHDs focused on heuristic algorithms to produce them, we decided to make a detailed study of this problem, including its complexity, approximability, and the design of practical heuristic algorithms.We generalized the maximin LHD construction problem by defining the problem of completing a partial LHD while respecting the maximin constraint. The subproblem where the partial LHD is initially empty corresponds to the classical LHD construction problem. We studied the complexity of the completion problem and proved its NP-completeness for many cases. As we did not determine the complexity of the subproblem, we searched for performance guarantees of algorithms which may be designed for both problems. On the one hand, we found that the completion problem is inapproximable for all norms in dimensions k ≥ 3. We also gave a weaker inapproximation result for norm L1 in dimension k = 2. On the other hand, we designed an approximation algorithm for the construction problem which we proved using two new upper bounds we introduced.Besides the theoretical aspect of this study, we worked on heuristic algorithms adapted for these problems, focusing on the Simulated Annealing metaheuristic. We proposed a new evaluation function for the construction problem and new mutations for both the construction and completion problems, improving the results found in the literature
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hypercubes"

1

Deza. Scale-isometric polytopal graphs in hypercubes and cubic lattices: Polytopes in hypercubes and Zn̳. London: Imperial College Press, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gurney, Kevin. Learning in networks of structured hypercubes. Uxbridge: Brunel University, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes. San Mateo, Calif: M. Kaufmann Publishers, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ranka, Sanjay, and Sartaj Sahni. Hypercube Algorithms. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-9692-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McBryan, Oliver A. Hypercube algorithms and implementations. New York: Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Afuah, Allan Nembo. The hypercube of innovation. Cambridge, Mass: Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992., 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Afuah, Allan Nembo. The hypercube of innovation. Cambridge, Mass: Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sun, Xian-He. Optimal cube-connected cube multiprocessors. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sun, Xian-He. Optimal cube-connected cube multiprocessors. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sun, Xian-He. Optimal cube-connected cube multiprocessors. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Hypercubes"

1

Diudea, Mircea Vasile. "Spongy Hypercubes." In Multi-shell Polyhedral Clusters, 363–84. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64123-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tsuiki, Hideki, and Yasuyuki Tsukamoto. "Imaginary Hypercubes." In Lecture Notes in Computer Science, 173–84. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13287-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tvrdík, Pavel. "On incomplete hypercubes." In Parallel Processing: CONPAR 92—VAPP V, 13–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55895-0_392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stout, Quentin F. "Hypercubes and Pyramids." In Pyramidal Systems for Computer Vision, 75–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-82940-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Koziol, Quincey, Wu-Chun Feng, Wu-Chun Feng, Heshan Lin, Jack Dongarra, Piotr Luszczek, Yale N. Patt, et al. "Hypercubes and Meshes." In Encyclopedia of Parallel Computing, 861–71. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_408.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Libert, Thierry. "Hypercubes of Duality." In Around and Beyond the Square of Opposition, 293–301. Basel: Springer Basel, 2012. http://dx.doi.org/10.1007/978-3-0348-0379-3_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhattacharyya, Arnab, and Yuichi Yoshida. "Functions Over Hypercubes." In Property Testing, 145–84. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-8622-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Devroye, Luc, László Györfi, and Gábor Lugosi. "Hypercubes and Discrete Spaces." In A Probabilistic Theory of Pattern Recognition, 461–77. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0711-5_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Balakrishnan, Shobana, Füsun Özgüner, and Baback Izadi. "Fault Tolerance in Hypercubes." In Parallel Computing on Distributed Memory Multiprocessors, 233–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-58066-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Damm, F., F. P. Heider, and G. Wambach. "MIMD-Factorisation on hypercubes." In Advances in Cryptology — EUROCRYPT'94, 400–409. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0053454.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hypercubes"

1

Wilson, David Bruce. "Embedding leveled hypercube algorithms into hypercubes (extended abstract)." In the fourth annual ACM symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/140901.141881.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abiyev, Rahib H., and Mustafa Tunay. "Optimization Search Using Hypercubes." In 2020 4th International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT). IEEE, 2020. http://dx.doi.org/10.1109/ismsit50672.2020.9255257.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lan, Youran, and Magdi A. Mohamed. "Parallel Quicksort in hypercubes." In the 1992 ACM/SIGAPP symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/130069.130085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Horan, R. E., and D. A. Poplawski. "Communication/computation paradigms for hypercubes." In the third conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/62297.62380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Ming-Chien, and Ming-Hour Yang. "Reliability analysis of balanced hypercubes." In 2012 Computing, Communications and Applications Conference (ComComAp). IEEE, 2012. http://dx.doi.org/10.1109/comcomap.2012.6154875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hastad, J., and T. Leighton. "Fast computation using faulty hypercubes." In the twenty-first annual ACM symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/73007.73031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Castorino, A., and G. Ciccarella. "Optimal-election algorithms for hypercubes." In Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99. IEEE, 1999. http://dx.doi.org/10.1109/empdp.1999.746673.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wilkinson, Kevin, and Alkis Simitsis. "Designing integration flows using hypercubes." In the 14th International Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1951365.1951425.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Greenberg, D., and S. Bhatt. "Routing multiple paths in hypercubes." In the second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/97444.97457.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Meraji, S., H. Sarbazi-Azad, and A. Patooghy. "Performance Modelling of Necklace Hypercubes." In 2007 IEEE International Parallel and Distributed Processing Symposium. IEEE, 2007. http://dx.doi.org/10.1109/ipdps.2007.370594.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hypercubes"

1

Hastad, Johan, Tom Leighton, and Mark Newman. Fast Computation Using Faulty Hypercubes. Fort Belvoir, VA: Defense Technical Information Center, May 1989. http://dx.doi.org/10.21236/ada211910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gropp, W. D., and I. C. Ipsen. Recursive Mesh Refinement on Hypercubes. Fort Belvoir, VA: Defense Technical Information Center, March 1988. http://dx.doi.org/10.21236/ada198695.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dunigan, T. H. A remote host facility for Intel hypercubes. Office of Scientific and Technical Information (OSTI), April 1989. http://dx.doi.org/10.2172/6024707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Womble, D. E. The performance of asynchronous algorithms on hypercubes. Office of Scientific and Technical Information (OSTI), December 1988. http://dx.doi.org/10.2172/6548901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dunigan, T. H. Performance of three hypercubes. [Ametek S14, Intel iPSC, Ncube]. Office of Scientific and Technical Information (OSTI), May 1987. http://dx.doi.org/10.2172/6595499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dunigan, T. Hypercube clock synchronization. Office of Scientific and Technical Information (OSTI), March 1991. http://dx.doi.org/10.2172/6389058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dunigan, T. H. A portable hypercube simulator. Office of Scientific and Technical Information (OSTI), July 1987. http://dx.doi.org/10.2172/6120006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Snelick, Robert D. Performance evaluation of hypercube applications:. Gaithersburg, MD: National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.ir.4630.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pfaltz, J., S. Son, and J. French. Implementation of a hypercube database system. Office of Scientific and Technical Information (OSTI), February 1990. http://dx.doi.org/10.2172/7251310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Collins, Joseph C., and III. Latin Hypercube Sampling in Sensitivity Analysis. Fort Belvoir, VA: Defense Technical Information Center, October 1994. http://dx.doi.org/10.21236/ada285867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hypercubes' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography