Recognition Algorithms for the Connection Machine
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. AI Architectures. Pages 57-59.
Abstract
This paper describes an object recognition algorithm both on a sequential machine and on a SIMD parallel processor such as the MIT Connection Machine . The parallel version is shown to run three to four orders of magnitude faster than the sequential version.
Anita M. Flynn, and John G. Harris. 1985. Recognition Algorithms for the Connection Machine. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 57–59. https://ijcai.org/proceedings/1985/12
Flynn, A. M., & Harris, J. G. (1985). Recognition Algorithms for the Connection Machine. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 (pp. 57–59). IJCAI. https://ijcai.org/proceedings/1985/12
@inproceedings{ijcai1985p12,
title = {Recognition Algorithms for the Connection Machine},
author = {Flynn, Anita M. and Harris, John G.},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {57--59},
year = {1985},
note = {AI Architectures},
url = {https://ijcai.org/proceedings/1985/12},
}
TY - CPAPER TI - Recognition Algorithms for the Connection Machine AU - Flynn, Anita M. AU - Harris, John G. T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 57 EP - 59 UR - https://ijcai.org/proceedings/1985/12 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: