Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Moret, Bernard
University of New Mexico
Albuquerque, New Mexico
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 5 of 5 reviews

   
  Hypercube algorithms
Ranka S. (ed), Sahni S., Springer-Verlag New York, Inc., New York, NY, 1990.  Type: Book (9780387973227)

An outgrowth of a short course taught by the authors at Bilkent University, this text is slim--237 pages in large type and open layout. In nine chapters it gives a general introduction to parallel algorithms for hypercube mac...

Feb 1 1992  
  Labeled trees and the efficient computation of derivations
Grossman R., Larson R.  Symbolic and algebraic computation (, Portland, OR, Jul 17-19, 1989) 801989.  Type: Proceedings

The parallel algorithm for the symbolic computation of (non-commutative) operators under composition given here is not new: the authors had proposed it in an earlier report, but only in sequential form. The point of this paper is to sh...

May 1 1991  
  Logic testing and design for testability
Fujiwara H., MIT Press, Cambridge, MA, 1986.  Type: Book (9789780262060967)

This text provides an excellent introduction to the problems of testing logic circuits. Written so as to be self-contained, it is usable both as a self-study guide for professionals and as a textbook for undergraduate and beginning gra...

Mar 1 1988  
  Computation: computability, similarity and duality
Jia-Wei H., John Wiley & Sons, Inc., New York, NY, 1986.  Type: Book (9780470203873)

This monograph presents an original view of computational models and complexity measures for parallel computation. The main topic is what the author calls the principle of similarity. Basically, the author shows that most deterministic...

Mar 1 1988  
  Parallel and sequential transformations on digital images
Yamashita M. Pattern Recognition 18(1): 31-41, 1985.  Type: Article

This paper presents some interesting results about the nature of sequential and parallel algorithms based on fixed neighborhoods. The exact type of algorithms investigated is one which invokes the same subroutine at each pixel, conside...

Apr 1 1986  
 
 
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy