"Hypercube Algorithms" - Information and Links:

Hypercube Algorithms - Info and Reading Options

with Applications to Image Processing and Pattern Recognition

Book's cover
The cover of “Hypercube Algorithms” - Open Library.

"Hypercube Algorithms" was published by Springer New York in 1990 - New York, NY, it has 237 pages and the language of the book is English.


“Hypercube Algorithms” Metadata:

  • Title: Hypercube Algorithms
  • Author:
  • Language: English
  • Number of Pages: 237
  • Publisher: Springer New York
  • Publish Date:
  • Publish Location: New York, NY

“Hypercube Algorithms” Subjects and Themes:

Edition Specifications:

  • Format: [electronic resource] :
  • Pagination: 1 online resource (ix, 237p.)

Edition Identifiers:

AI-generated Review of “Hypercube Algorithms”:


"Hypercube Algorithms" Table Of Contents:

  • 1- Contents: Introduction
  • 2- Fundamental Operations
  • 3- SIMD Matrix Multiplication
  • 4- One Dimensional Convolution
  • 5- Template Matching
  • 6- Hough Transform
  • 7- Clustering
  • 8- Image Transformations
  • 9- SIMD String Editing
  • 10- References
  • 11- Index.

"Hypercube Algorithms" Description:

The Open Library:

Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problems size. However, for image processing problems, the book also includes algorithms for and MIMD hypercube with a small number of processes. Experimental results on an NCUBE/77 MIMD hypercube are also presented. The book is suitable for use in a one-semester or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.

Read “Hypercube Algorithms”:

Read “Hypercube Algorithms” by choosing from the options below.

Search for “Hypercube Algorithms” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Hypercube Algorithms” in Libraries Near You:

Read or borrow “Hypercube Algorithms” from your local library.

Buy “Hypercube Algorithms” online:

Shop for “Hypercube Algorithms” on popular online marketplaces.