American Journal of Applied Sciences · 2009 · 11 citations · 8 references
ComputingComputer EngineeringComputer ScienceAlgorithmsData MiningData StructuresData Structure AlgorithmsMatrix ComputationMatrix StructureNearest Neighbor SearchSearching AlgorithmsBrute-force SearchComputational Matrix TheoryData AccessDigital Data StorageMatrix ProcessingSparse Matrix AlgorithmsSparse Matrix ComputationStructured Matrix Computation
The heavy demand for large volumes of digital data has increased the interest in matrix-like representation. Matrices are well organized data structures which are suitable to store uniform data in order to simplify data access and manipulation. For several applications, the need is critical to efficiently search for a specific pattern in matrix structures. A pattern can be represented as an ndimensional matrix which can be searched for within other larger n-dimensional matrices. This query will be referred to as matrix submatching. In this paper, we present and compare two algorithms for binary matrix submatching on the basis of time requirement. The first algorithm is a naive brute force approach with O(n 2 m 2 ) time requirement. The second approach is based on chain code transformation which reduces the sizes of matrices resulting in less time requirement.
8
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
1990 · 3.1K citations
Fast Pattern Matching in Strings
Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations
Matrix multiplication via arithmetic progressions
Don Coppersmith, S. Winograd · Journal of Symbolic Computation · 1990 · 2.3K citations