kumar@uunet.UU.NET (Vipin Kumar) (05/16/88)
Workshop on Parallel Algorithms
for Machine Intelligence and Pattern Recognition
Sponsored by the American Association of Artificial Intelligence
Aug.20 and 21, 1988.
St. Paul, Minnesota
Organizing Committee:
Prof. Laveen N. Kanal (kanal@mimsy.umd.edu)
Dept. of Computer Science
University of Maryland College Park, Md., 20742
Dr. P.S. Gopalakrishnan (PSG@ibm.com)
T.J. Watson Research Center, 39-238
P.O.Box 218
Yorktown Heights, N.Y. 10598
Prof. Vipin Kumar (kumar@sally.utexas.edu)
Computer Science Dept.
Univ. of Texas at Austin
Austin, Texas, 78712.
There is much interest in AI in parallel algorithms for exploring
higher level knowledge representations and structural relationships. Parallel
algorithms for search, combinatorial optimization, constraint satisfaction,
parallel production systems, and pattern and graph matching are expressions of
this interest. There is also considerable interest and ongoing work on
parallel algorithms for lower level analysis of data, in
particular, in vision, speech and signal processing, often based on stochastic
models. For practical applications of machine intelligence and pattern
recognition the question arises as to the extent to which parallelism
for high and low level analysis can be achieved in an integrated manner.
The workshop will aim at bringing together individuals working in each of
the above two aspects of parallel algorithms to consider the basic nature
of the procedures involved and the degree to which parallel
approaches to high and low level operations in machine intelligence,
pattern recognition, and signal processing can be integrated.
Contributors interested in participating in this workshop are requested to
submit a 1000-2000 word extended abstract of their work on parallel algorithms
in areas of Machine Intelligence and Pattern Recognition. Areas of interest
include Search Problems in A.I. and Pattern recognition, high and low level
processing in Computer Vision, Speech Recognition, Optimization Problems
in A.I.,Constraint Satisfaction, and Pattern and Graph matching.
The number of participants at the workshop must be limited due to limited
room size.
Abstracts should be sent as soon as possible and must reach the organizers
no later than June 1,1988. Abstracts may be sent by electronic mail to all
the organizers at the e-mail addresses shown. Hard copy versions of each
abstract should also be sent to one of the organizers.
Responses to all who submit abstracts will be sent by July 1, 1988.