Efficient algorithms for k maximum sums

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 137-148

  Bengtsson, Fredrik ^a   Chen, Jingsen ^a  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FAST ALGORITHMS; INTEGER PARAMETERS; LINEAR TIME; MULTI DIMENSIONAL; REAL NUMBER; TIME ALGORITHMS; USER-DEFINED PARAMETERS;

PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 26844581198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_14     Document Type: Article

References (18)

1. Weiss, M.: Data Structures and Algorithm Analysis (2nd Edition). Addison-Wesley (1995)
2. Bentley, J.: Programming pearls: Algorithm design techniques. Communications of the ACM 27 (1985) 865-871
3. Grenander, U.: Pattern Analysis. Springer-Verlag, New York (1978)
4. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. (1993) 207-216
5. Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. (1996) 13-23
6. Bentley, J.: Programming pearls: Perspective on performance. Communications of the ACM 27 (1985) 1087-1092
7. Gries, D.: A note on the standard strategy for developing loop invariants and loops. Science of Computer Programming 2 (1982) 207-214
8. Smith, D.: Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming 8 (1987) 213-229
9. Tamaki, H., 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) 446-452
10. Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In: Proceedings of the 2002 Australian Theory Symposium. (2002) 189-198
11. Akl, S., Guenther, G.: Application of broadcasting with selective reduction to the maximal sum subsegment problem. International Journal of High Speed Computing 3 (1991) 107-119
12. Perumalla, K., Deo, N.: Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters 5 (1995) 367-373
13. Qiu, K., Akl, S.: Parallel maximum sum algorithms on interconnection networks. Technical Report No. 99-431, Jodrey School of Computer Science, Acadia University, Canada (1999)
14. Bae, S.E., Takaoka, T.: Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem. In: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks. (2004) 247-253
15. Frederickson, G., Johnson, D.: The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences 24 (1982) 197-208
16. Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing 13 (1984) 14-30
17. Riedewald, M., Agrawal, D., Abbadi, A.E.: Flexible data cubes for online aggregation. In: International Conference on Database Theory. LNCS (2001) 159-173
18. Bengtsson, F., Chen, J.: Computing the k maximum subarrays fast. Technical Report No. 2004:07, Luleå University of Technology, Luleå, Sweden (2004)