2-DIMENSIONAL PATTERN-MATCHING BY SAMPLING

被引：2
|
作者：
CROCHEMORE, M
GASIENIEC, L
RYTTER, W
机构：
[1] WARSAW UNIV,INST INFORMAT,PL-02097 WARSAW,POLAND
[2] UNIV CALIF RIVERSIDE,DEPT COMP SCI,RIVERSIDE,CA 92521
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 46卷 / 04期
关键词：
ANALYSIS OF ALGORITHMS;
D O I：
10.1016/0020-0190(93)90020-A
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We extend the concept of deterministic sampling to the two-dimensional pattern matching problem. We show that almost all patterns have a logarithmic deterministic sample. There are 2D-matching algorithms which work efficiently for almost all patterns. They solve the 2D-matching problem in linear sequential time with O(1) space, or, alternatively in O(1) parallel time with linear number of processors. This is the first attempt to reduce the space for two-dimensional pattern matching.
引用
收藏
页码：159 / 162
页数：4
相关论文
共 50 条
12345