Abstract
Syntactic methods are an important tool for tackling recognition and classification problems. In areas such as the analysis of natural languages, or speech recognition, the syntactic approach gains wide interest by the scientific community. The complexity of the patterns and the wide variety of the features that characterize them, makes impractical the use of common decision-theoretic approaches [1]. In many applications, such as the processing of biomedical signals (e.g., ECG, EEG, e.t.a.), syntactic methods have been considered as an alternative way of simultaneous detection and classification of some characteristic complexes of these signals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. S. Fu “Syntactic Pattern Recognition and Applications” Prentice-Hall 1982
D. H. Younger “Recognition and parsing of context-free languages in time n3” Information and Control Vol. 10 pp. 189–208 1967
V. Acho, J. D. Ullman “The theory of Parsing Translating and Compiling” Vol. I Prentice Hall Inc.
J. Earley “An efficient context-free parsing algorithm” Commun. of the ACM Vol. 13 pp. 94–102.
L. Valiant “General context free recognition in less than cubic time” Journal of Computer and System Science Vol. 10, pp. 308–315, 1975.
S. L. Graham, M. A. Harrison and W. L. Ruzzo, “On line context-free languages recognition in less than cubic time” in Proc, 8th Annu. ACM Symp. Theory of Comput., May 1976.
T. Kasami “An efficient recognition and syntax analysis algorithm for context free languages”, Science Report AF CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Mass. 1965
Y. T. Chiang and K. S. Fu “Parallel parsing algorithms and VLSI implementation for syntactic pattern recognition” IEEE Trans. Pattern Anal. Mach. Intell. PAMI-7 (1985).
H.D. Chen, X., Chen “Shape recognition using VLSI Architecture” The Int. Journal of Pattern. Recgn. and Art. Intell. 1993.
T. Andronikos, N. Koziris, Z. Tsiatsoulis, G. Papakonstantinou, P. Tsanakas “Lower Time and Processor Bounds for Efficient Mapping od Dependence Algorithms into Systolic Arrays” Journal of Parallel Algorithms and Applications Vol 10 pp. 177–194, 1997
Andronikos, T., Koziris, N., Papakonstantinou, G., and Tsanakas, P. “Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs”, Proceedings of 11 th IEEE/ACM International Parallel Processing Symposium (IPPS 97), pp. 146–151, Geneva, Switzerland.
Bampis, E.,. Delorme, C., and Konig, J.C. Optimal Schedules for d-D Grid Graphs with Communication Delays. Symposium on Theoretical Aspects of Computer Science (STACS96). Grenoble France 1996.
Koziris, N., Papakonstantinou, G., and Tsanakas, P. Automatic Loop Mapping and Partitioning into Systolic Architectures. Proceedings of the 5th Panhellenic Conference on Informatics, Dec. 1995, pp. 777–790, Athens
Lee, P.-Z. and Kedem, Z.M. Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays. IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 1, pp. 64–76, Jan. 1990.
Moldovan, D.I. ADVIS: A Software Package for the Design of Systolic Arrrays, IEEE Trans. Computer Aided Design, vol CAD-6, no 1, pp. 33–40, Jan. 1987.
Shang, W. and Fortes, J.A.B., Time Optimal Linear Schedules for Algorithms with Uniform Dependencies, IEEE Trans. Comput., vol. 40, no. 6, pp. 723–742, June 1991.
N. Koziris, G. Economakos, A. Pappas, Sylvain de Noyer, Timothee Mangenot, G Papakonstantinou, P. Tsanakas. “Automatic Mapping and Partitioning of Nested Loops into Systolic Arrays Architectures Using VHDL-The MASH environment”, Internal Technical Report Digital System and Computer Laboratory 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Koulouris, A., Koziris, N., Papakonstantinou, G., Tsanakas, P. (1999). An Array Architecture for Syntactic Pattern Recognition. In: Tzafestas, S.G. (eds) Advances in Intelligent Systems. International Series on Microprocessor-Based and Intelligent Systems Engineering, vol 21. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4840-5_8
Download citation
DOI: https://doi.org/10.1007/978-94-011-4840-5_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-0393-6
Online ISBN: 978-94-011-4840-5
eBook Packages: Springer Book Archive