kumar@cs.utexas.edu (Vipin Kumar) (04/22/89)
WORKSHOP ANNOUNCEMENT - CALL FOR PARTICIPATION
IJCAI-89 Workshop on Parallel Algorithms
for Machine Intelligence
Sponsored by the American Association of Artificial Intelligence
Sunday, August 20, 1989.
Detroit, Michigan
Organizing Committee:
Prof. Laveen N. Kanal (kanal@mimsy.umd.edu)
Dept. of Computer Science
University of Maryland College Park, Md., 20742
(301) 454-7877
Prof. Vipin Kumar (kumar@cs.utexas.edu)
Computer Science Dept.
Univ. of Texas at Austin
Austin, Texas, 78712.
(512) 471-9571
Dr. P.S. Gopalakrishnan (PSG@ibm.com)
T.J. Watson Research Center, 39-238
P.O.Box 218
Yorktown Heights, N.Y. 10598
(914)945-2502
There is much interest in the AI community 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. Areas of interest
include Search Problems in AI and Pattern recognition, high and low level
processing in Computer Vision, Speech Recognition, Optimization Problems
in AI, Constraint Satisfaction, and Pattern and Graph matching.
Researchers interested in participating in this workshop are requested to
submit a 1000-2000 word abstract outlining important results or promising
work in progress. You may also wish to send a reprint of a related
publication and a list of your recent publications in this area.
Hard copies of abstracts and other relevant material should reach all the
organizers no later than June 1,1989. Abstracts may be sent by electronic
mail to all the organizers at the e-mail addresses shown to expedite review.
Responses to all who submit abstracts will be sent by July 1, 1989.