Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 247-253

  Bae, Sung Eun ^a   Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Maximum subarray; Maximum subsequence; Prefix sums; VLSI

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; DATA MINING; DATA REDUCTION; IMAGE PROCESSING; OPTIMIZATION; PARALLEL ALGORITHMS; PATTERN RECOGNITION; VLSI CIRCUITS;

MAXIMUM SUBARRAYS; MAXIMUM SUBSEQUENCE; PREFIX SUMS; VLSI;

PARALLEL PROCESSING SYSTEMS;

EID: 3543136082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. BAE, S. E., AND TAKAOKA, T. Parallel approaches to the maximum subarray problem. In Proc. of the seventh Japan-Korea Workshop on Algorithms and Computation (2003), pp. 94-104.
2. BATCHER, K. E. Sorting networks and their applications. In in Proc. 4FIPS FJCC (1968), vol. 32, pp. 307-314.
3. BENTLEY, J. Programming pearls: algorithm design techniques. Commun. ACM 27, 9 (1984), 865-873.
4. BENTLEY, J. Programming pearls: perspective on performance. Commun. ACM 27, 11 (1984), 1087-1092.
5. EPPSTEIN, D. Finding the k shortest paths. In IEEE Symposium on Foundations of Computer Science (1994), pp. 154-165.
6. JODREY, K. Q. Parallel maximum sum algorithms on interconnection networks.
7. 2) algorithm for k shortest simple paths in an undirected graph with nonnegative arc length. IEICE Trans. Information & Systems E61 (1978), 971-972.
8. KATOH, N., IBARAKI, T., AND MINE, H. An efficient algorithm for k shortest simple paths. Networks 12, 4 (1982), 411-427.
9. PERUMALLA, K., AND DEO, N. Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters 5, 3 (1995), 367-373.
10. SUGIMOTO, K., AND KATOH, N. An algorithm for finding k shortest loopless paths in a directed network. Trans. Information Processing Soc. Japan 26 (1985), 356-364.
11. TAKAOKA, T. Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In Electronic Notes in Theoretical Computer Science (2002), J. Harland, Ed., vol. 61, Elsevier.
12. TAMAKI, H., AND TOKUYAMA, T. Algorithms for the maximum subarray problem based on matrix multiplication. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (1998), Society for Industrial and Applied Mathematics, pp. 446-452.
13. WEN, Z. Fast parallel algoritihms for the maximum sum problem. Parallel Computing 21, 3 (1995), 461-466.