[comp.parallel] Talk Announcement: PARALLEL TEMPLATE MATCHING

kumar@uunet.uu.net (Vipin Kumar) (05/03/88)

Computer Science Department Colloquium:

           PARALLEL TEMPLATE MATCHING

                Sartaj Sahni
          University of Minnesota
          sahni@csfsa.cs.umn.edu



Asymptotically fast algorithms for parallel image
template matching on SIMD and MIMD hypercube and
mesh multicomputers are developed.  Unlike earlier
parallel algorithms for this operation, our algorithms
do not require a broadcast capability.  In addition,
we report on the results of experiments using
the NCUBE hypercube.  The performance of this hypercube
is compared to that of the Cray 2 supercomputer.


Time: 11am-Noon
Date: May 3, 1988
Place: Taylor 3.128 (Faculty Lounge)
Host: Vipin Kumar