AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O(n2m3), where the size of the text is n×n and the size of the pattern is m×m. In this paper we present a new algorithm for the problem whose running time is O(n2m2)
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variet...
AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rota...
AbstractThe problem of pattern matching with rotation is that of finding all occurrences of a two-di...
AbstractThe problem of two-dimensional pattern matching invariant under a given class of admissible ...
AbstractWe present new and faster algorithms to search for a two-dimensional pattern in a two-dimens...
We present new and faster algorithms to search for a two-dimensional pattern in a two-dimensional te...
[[abstract]]Based on 2-D cluster approach, a fast algorithm for point pattern matching is proposed t...
[[abstract]]© 1997 Elsevier-Based on 2D cluster approach, a fast algorithm for point pattern matchin...
Abstract. We present an index to search a two-dimensional pattern of size m m in a two-dimensional ...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exa...
Pattern matching is the area of computer science which deals with security and analysis of data. Thi...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variet...
AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rota...
AbstractThe problem of pattern matching with rotation is that of finding all occurrences of a two-di...
AbstractThe problem of two-dimensional pattern matching invariant under a given class of admissible ...
AbstractWe present new and faster algorithms to search for a two-dimensional pattern in a two-dimens...
We present new and faster algorithms to search for a two-dimensional pattern in a two-dimensional te...
[[abstract]]Based on 2-D cluster approach, a fast algorithm for point pattern matching is proposed t...
[[abstract]]© 1997 Elsevier-Based on 2D cluster approach, a fast algorithm for point pattern matchin...
Abstract. We present an index to search a two-dimensional pattern of size m m in a two-dimensional ...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exa...
Pattern matching is the area of computer science which deals with security and analysis of data. Thi...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variet...
DOI
Add to ORKG