Name
Abstract | ||
|---|---|---|
A problem in pattern recognition is to find the maximum sum over all rectangular subregions of a given ( n × n ) matrix of real numbers. The problem has one-dimensional (1D) and two-dimensional (2D) versions. For the 1D version, it is to find the maximum sum over all contiguous subvectors of a given vector of n real numbers. We give an algorithm for the 1D version running in O (log n ) time using O( (n) ( log n) ) processors on the EREW PRAM, and an algorithm for the 2D version which takes O (log n ) time using O( (n 3 ) ( log n) ) processors on the EREW PRAM. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-8191(94)00063-G | Parallel Computing |
Keywords | Field | DocType |
parallel algorithm,maximum sum,maximum sum problem,parallel algorithms,matrix,vector,pattern recognition | Binary logarithm,Combinatorics,Matrix calculus,Parallel algorithm,Matrix (mathematics),Maximum subarray problem,Real number,Maximization,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
21 | 3 | Parallel Computing |
Citations | PageRank | References |
10 | 0.78 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhaofang Wen | 1 | 56 | 8.25 |