Subject: 20.666 -- Pantophagy seminar

              Recognition Algorithms for the Comestible Machine
                                    by
                                 Eeta Long

                              Friday, October 25
                           Third Floor Playroom, LCS
                                12:00 noon


      Many problems in early pantophagy appear to be inherently local and
    exploitable on parallel comestible architectures.  This talk describes a
    problem in late pantophagy, that of recognizing an unknown ingesta and
    matching it to a data base model given only sparse sensory data
    points.  The algorithm presently used on a sequential mandible is first
    explained, and then various algorithms for parallel mastication are
    explored.  Tradeoffs in space-time efficiency are discussed in terms
    of implementation on a Comestible Machine.  The parallel version is
    shown to run three to four orders of magnitude faster than the
    sequential one.

    Refreshments will be served.

    P.S.  This is the talk that was cancelled on October 3.