| OCR Text |
Show 302 [202) D. Waltz. Understanding Line Drawings of Scenes with Shadows. In P. H. Winston, The Psychology of Computer Vision, chapter 2, pages 19- 92. McGraw-Hill Book Company, New York, 1975. [203) W. Wang, J. Gu, and T. C. Henderson. A Pipelined Architecture for Parallel Image Relaxation Operations. IEEE Trans. on Circuits and Systems, CAS- 34(11):1375-1384, Nov. 1987. [204] W. Wang, J. Gu, and K. F. Smith. A Regular Layout for Concurrent Discrete Relaxation Computation. In Proceedings of 1987 IEEE International CAS Symposium, May 1987. [205] U. Weiser and A. Davis. A Wavefront Notation Tool for VLSI Array Design. In B. Sproull H. T. Kung and G. Steele, editors, Proceedings of CMU Conference on VLSI System and Computations, pages 226-234, Oct. 1981. [206] M. B. Wells, editor. Elements of Combinatorial Computing. Pergamon Press, Oxford, 1971. [207] C. Whitby-Strevens. The Transputer. In the 12th Annual International Symposium on Computer Architecture, pages 292-300, June 17-19 1985. [208] P. H. Winston. Artificial Intelligence. Addison-Wesley, Reading, 1984. [209] C. L. Wu and T. Y. Feng, editors. Interconnection Networks for Parallel and Distributed Processing. IEEE Computer Society Press, Washington D. C., 1984. [210] C. -F. Yu. Efficient Combinatorial Search Algorithm. PhD thesis, School of Electrical Engineering, Purdue University, West Lafayette, IN, Dec. 1986. [211) C. -F. Yu and B. W. Wah. Efficient Branch-and-Bound Algorithms on a TwoLevel Memory System. IEEE Trans. on Software Engineering, 14(9):1342- 1356, Sept 1988. [212] C. -F. Yu and B. W. Wah. Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search. IEEE Trans. on Software Engineering, 11(9):922-934, Sept 1985. [213] G. Zorpette. Massive Parallelism Rivals Supercomputers. IEEE Spectrum, 26(1 ):29-30, Jan. 1989. [214] S. W. Zucker, R. A. Hummel, and A. Rosenfeld. An Application of Relaxation Labeling to Line and Curve Enhancement. IEEE Trans. on Computers, C- 26:394-403,922-929, 1977. |
