Hypercube Algorithms: with Applications to Image Processing and Pattern Recognition (Bilkent University Lecture Series)
Language: English
Published by Springer, 1990
- Hardcover
- Used

Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
5-star seller
AbeBooks seller since March 9, 2023
Hardcover
Condition: Used - Very good
US$ 10.94
Free Shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.
Seller Inventory # OTV.0387973222.VG
- Title
- Hypercube Algorithms: with Applications to Image Processing and Pattern Recognition (Bilkent University Lecture Series)
- Author
- Ranka, Sanjay; Sahni, Sartaj
- Publisher
- Springer
- Publication year
- 1990
- Condition
- very_good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0387973222
- ISBN 13
- 9780387973227
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.
"Synopsis" may belong to another edition of this title.
-OnTimeBooks-
Phoenix, AZ, U.S.A.
5-star seller
AbeBooks seller since March 9, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Specialty
Used books of all typesSeller's business information
BookDrop LLC
601 S 54th Ave, STE 101
Phoenix, AZ U.S.A. 85043