EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION*
作者:
SAJALK. DAS,
PAULS. FISHER,
HUA ZHANG,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1994)
卷期:
Volume 2,
issue 1-2
页码: 81-98
ISSN:1063-7192
年代: 1994
DOI:10.1080/10637199408915408
出版商: Taylor & Francis Group
关键词: KEY WORDS: Finitely inductive sequences;integer sorting;Parallel algorithms;pattern recognition;string matching;F.2.2;E1.2;1.5.0
数据来源: Taylor
摘要:
Finitely inductive (Fl) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pattern recognition using the Fl technique first transforms known patterns into function table(s) byfactoring, and then uses the function table(s) to match an input pattern byfollowing. Factoring is done off line and only once for each pattern. The sequential time for matching two sequences depends only upon the length of the input sequence. In this paper, we propose cost-optimal (i.e., efficient) parallel algorithms for Fl sequence processing. These algorithms include parallelfactoring and followingby bucket packing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. The proposed algorithms also have implications to parallel integer sorting.
点击下载:
PDF (340KB)
返 回