Abstract
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 0(1) space, or, alternatively in 0(1) parallel time with linear number of processors. This is the first attempt to reduce the space for two-dimensional pattern matching.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 159-162 |
| Number of pages | 4 |
| Journal | Information Processing Letters |
| Volume | 46 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jun 25 1993 |
| Externally published | Yes |
Keywords
- Analysis of algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
Fingerprint Dive into the research topics of 'Two-dimensional pattern matching by sampling'. Together they form a unique fingerprint.
Cite this
Crochemore, M., Ga̧sieniec, L., & Rytter, W. (1993). Two-dimensional pattern matching by sampling. Information Processing Letters, 46(4), 159-162. https://doi.org/10.1016/0020-0190(93)90020-A