Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
A sequential optical character recognition algorithm, ideally suited for implementation by means of microprocessors with limited storage capabilities, is formulated in terms of a binary decision tree. Upper bounds on the recognition performance are derived in terms of the stability of the digitized picture elements. The design process is described in detail. The algorithm is tested on single-font typewritten characters and the experimental and theoretical results are compared. © 1983 IEEE
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Limin Hu
IEEE/ACM Transactions on Networking
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
B.K. Boguraev, Mary S. Neff
HICSS 2000