CONFERENCE GOALS
CAMP 2000 is the fifth in a series of workshops initiated with CAMP '91 in Paris,
and followed by CAMP '93 in New Orleans, CAMP '95 in Como and CAMP '97 in Boston.
The CAMP workshops represent a continuation of the very successful IEEE CAPAMI
(Computer Architectures for Pattern Analysis and Machine Intelligence)
workshops held during the 1970's and 1980's.
The purpose of these meetings is to bring together researchers who seek to improve the
performance of machine perception systems through
a combination of specialized hardware and software.
TOPICS
Topics include but are not limited to:
- Architectures for image understanding, sound recognition, other senses
- Configurable and FPGA-based perception architectures
- Parallel architectures and algorithms for machine perception
- Coprocessors and Instruction Set Architecture extensions
- Smart sensors and sensor fusion
- Inference engines and machine intelligence architectures
- Rule-based systems and knowledge-based machines
- Architectural performance evaluation
- Distributed processing for perception systems
- Internet Imaging
- Parallel video servers
- Languages, software environments and programming tools
- Neural network and genetic algorithm applications in
perception
CONFERENCE CHAIR
Concettina Guerra
Dipartimento di Elettronica e Informatica
Universita' di Padova
Padova, Italy
email: guerra@dei.unipd.it
PROGRAM CHAIR
Virginio Cantoni
Universita' di Pavia
Dipartimento di Informatica e Sistemistica
Pavia, Italy
email: cantoni@ipvvis.unipv.it
SUBMISSION OF PAPERS
Electronic submission is encouraged in postscript or PDF.
Alternatively, four copies of an extended abstract
can be submitted via regular mail to the Program Chair.
Additional information will be avaiable soon.
Deadlines:
Abstracts received: February 28, 2000
Notification of acceptance: March 31, 2000
Manuscripts due: April 30, 2000
WORKSHOP VENUE
Padova is a pleasant historical city, home to
one of the oldest and most prestigious Universities in Europe.
Venice is only 15 miles away, and is easily reached by bus or train.
| |