Books on the topic 'Hypercuts'

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

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

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

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

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

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

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

Grunwald, Dirk C. Benchmarking hypercube hardware and software. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Dandamudi, Sivarama P. Hierarchical hypercube multicomputer interconnection networks. E. Horwood, 1991.

Tannous, Joumana. Hypercube: Drawing an invisible world. Oxford Brookes University, 1999.

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

Ball, David. Induction by a Hilbert hypercure representation. Aston University. Department ofComputer Science and Applied Mathematics, 1991.

David, Ball. Induction by a Hilbert hypercure representation. Aston University. Department of Computer Science andApplied Mathematics, 1991.

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

Wagner, Alan. Embedding binary trees in a hypercube. Computer Systems Research Institute, University of Toronto, 1985.

P, Nas, and Samuels Annemarie, eds. Hypercity: The symbolic side of urbanism. Kegan Paul, 2006.

Kozyrev, V. P. Predstavlenie N-kuba otrezkami Evklidova prostranstva. VT︠S︡ RAN, 2008.

Bokhari, Shahid H. Complete exchange on the iPSC-860. National Aeronautics and Space Administration, Langley Research Center, 1991.

G, Shin Kang, United States. National Aeronautics and Space Administration., and United States. Office of Naval Research., eds. Adaptive fault-tolerant routing in hypercube multicomputers. Real-Time Computing Laboratory, Dept. of Electrical Engineering and Computer Science, The University of Michigan, 1990.

United States. National Aeronautics and Space Administration. Scientific and Technical Information Program., ed. Generalized hypercube structures and hyperswitch communication netrwork. National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1992.

G, Shin Kang, United States. National Aeronautics and Space Administration., and United States. Office of Naval Research., eds. Adaptive fault-tolerant routing in hypercube multicomputers. Real-Time Computing Laboratory, Dept. of Electrical Engineering and Computer Science, The University of Michigan, 1990.

Young, Steven D. Generalized hypercube structures and hyperswitch communication network. Langley Research Center, 1992.

Prager, Robert. An algorithm for routing in hypercube networks. University of Toronto, Dept. of Computer Science, 1986.

T, Heath Michael, and Oak Ridge National Laboratory, eds. Hypercube multiprocessors, 1986: Proceedings of the First Conference on Hypercube Multiprocessors, Knoxville, Tennessee, August 24-27, 1985. SIAM, 1986.

Conference on Hypercube Multiprocessors (2nd 1986 Knoxville, Tenn.). Hypercube multiprocessors, 1987: Proceedings of the Second Conference on Hypercube Multiprocessors, Knoxville, Tennessee, September 29-October 1, 1986. Siam, 1987.

Li, Guangye. A parallel triangular solver for a hypercube multiprocessor. Cornell Theory Center, Cornell University, 1986.

H, Calalo Ruel, and Jet Propulsion Laboratory (U.S.), eds. Hypercube matrix computation task: Report for 1986-1987. National Aeronautics and Space Administration, Jet Propulsion Laboratory, California Institute of Technology, 1987.

Rigoutsos, Isidore. Scalable parallel geometric hashing for hypercube SIMD architectures. Courant Institute of Mathematical Sciences, New York University, 1991.

Bokhari, Shahid H. Communication overhead on the Intel iPSC-860 hypercube. National Aeronautics and Space Administration, Langley Research Center, 1990.

Jet Propulsion Laboratory (U.S.), ed. Conf erence on Hypercube Concurrent Computers and Applications. Association for Computing Machinery, 1988.

H, Calalo Ruel, and Jet Propulsion Laboratory (U.S.), eds. Hypercube matrix computation task: Report for 1986-1988. National Aeronautics and Space Administration, Jet Propulsion Laboratory, California Institute of Technology, 1988.

Bokhari, Shahid H. Multiphase complete exchange on a circuit switched hypercube. National Aeronautics and Space Administration, Langley Research Center, 1991.

Conference on Hypercube Multiprocessors (3rd 1988 Pasadena, Calif.). The Third Conference on Hypercube Concurrent Computers and Applications. Association for Computing Machinery, 1988.

Joslin, Ronald D. Parallel spatial direct numerical simulations on the Intel IPSC/860 hypercube. National Aeronautics and Space Administration, Langley Research Center, 1993.

Naik, Vijay K. Performance studies of the multigrid algorithms implemented on hypercube multiprocessor systems. ICASE, 1987.

Cole, Gary L. Initial operating capability for the hypercluster parallel-processing test bed. National Aeronautics and Space Administration, 1989.

Angela, Quealy, Cole Gary L, and United States. National Aeronautics and Space Administration., eds. A message passing kernel for the hypercluster parallel processing test bed. National Aeronautics and Space Administration, 1989.

Neta, Beny. Solution of linear initial value problems on a hypercube. Naval Postgraduate School, 1988.

Ranka, Sanjay. Hypercube Algorithms: With Applications to Image Processing and Pattern Recognition. Springer New York, 1990.

N, Swarztrauber Paul, and Research Institute for Advanced Computer Science (U.S.), eds. Ordered fast Fourier transforms on a massively parallel hypercube multiprocessor. Research Institute for Advanced Computer Science, NASA Ames Research Center, 1989.

Ranka, Sanjay. Hypercube algorithms: With applications to image processing and pattern recognition. Springer-Verlag, 1990.

European Workshop on Hypercube and Distributed Computers (1st 1989 Rennes, France). Hypercube and distributed computers: Proceedings of the First European Workshop on Hypercube and Distributed Computers, held in Rennes, France, 4-6 October, 1989. North-Holland, 1989.

Codling, Stuart. Lamborghini supercars 50 years: From the groundbreaking Miura to today's hypercars. Motorbooks, an imprint of Quarto Publishing Group USA Inc., 2015.

Eric, Barszcz, and Ames Research Center, eds. Performance of a parallel code for Euler equations on hypercube computers. National Aeronautics and Space Administration, Ames Research Center, 1990.

United States. National Aeronautics and Space Administration., ed. A parallel algorithm for switch-level timing simulation on a hypercube multiprocessor. Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, 1989.

Bokhari, Shahid H. Multiphase complete exchange on paragon, SP2 & CS-2. National Aeronautics and Space Administration, Langley Research Center, 1995.

Bruno, John. Report on the feasibility of hypercube concurrent processing systems in computational fluid dynamics. Research Institute for Advanced Computer Science, 1986.

United States. National Aeronautics and Space Administration., ed. Parallelization of finite element analysis codes using heterogeneous distributed computing: NASA grant--NAG3-1440, final report, start date--January 15, 1993, end date--March 31, 1996. National Aeronautics and Space Administration, 1996.

Rendle, Steve. Hypercars. Rosen Publishing Group, 2021.

Rendle, Steve. Hypercars. Rosen Publishing Group, 2021.