In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Arturs Backurs, Nishanth Dikkala, Christos Tzamos
- ICALP
- 2016

Given n weighted points (positive or negative) in d dimensions, what is the axis-aligned box which maximizes the total weight of… (More)

Is this relevant?

2014

2014

- Tadao Takaoka
- 2014

Parallel algorithm design is generally hard. Parallel program verification is even harder. We take an example from the maximum… (More)

Is this relevant?

2013

2013

- Stephen J. Weddell, Tristan Read, Mohammed Thaher, Tadao Takaoka
- J. Electronic Imaging
- 2013

The maximum subarray problem is used to identify the subarray of a two dimensional array, where the sum of elements is maximized… (More)

Is this relevant?

2012

2012

- S. Saleh, Marwan Abdellah, Abdul Raouf, Y. M. Kadah
- 2012 Cairo International Biomedical Engineering…
- 2012

The Maximum Subarray Problem (MSP) finds a segment of an array that has the maximum summation over all the other possible… (More)

Is this relevant?

2007

2007

- Sung Eun Bae, Tadao Takaoka, Jae-Chul Joh
- 2007

The maximum subarray problem (MSP) involves selection of a segment of consecutive array elements that has the largest possible… (More)

Is this relevant?

2007

2007

- Sung Eun Bae, Tadao Takaoka
- ISAAC
- 2007

We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix… (More)

Is this relevant?

2006

2006

- Sung Eun Bae, Tadao Takaoka
- Comput. J.
- 2006

Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to… (More)

Is this relevant?

2006

2006

- Sung Eun Bae, Tadao Takaoka
- International Conference on Computational Science
- 2006

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum… (More)

Is this relevant?

2005

2005

- Sung Eun Bae, Tadao Takaoka
- COCOON
- 2005

The maximum subarray problem for a oneor two-dimensional array is to find the array portion that maiximizes the sum of array… (More)

Is this relevant?

2002

2002

- Tadao Takaoka
- Electr. Notes Theor. Comput. Sci.
- 2002

We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution… (More)

Is this relevant?