Algorithms for the maximum subarray problem based on matrix multiplication
Hisao Tamaki,Takeshi Tokuyama +1 more
- 01 Jan 1998
- pp 446-452
55
TL;DR: The first subcubic algorithm for this problem was proposed by as mentioned in this paper, where the scalar product and addition in usual matrix multiplication are replaced by addition and max operations, respectively.
read more
Abstract: Given an M×N array of reals, we want to find a rectangular contiguous subarray such that the sum of the entries in the subarray is maximized. Since Bentley posed this problem in his Programming Pearls column in 1984 with an O (NM 2) time solution, no progress on the sequential complexity has been reported to date. We give the first subcubic algorithm, by reducing the problem to “funny matrix multiplication”, where the scalar product and addition in usual matrix multiplication are replaced by addition and max operations, respectively. We also give a faster e-approximation algorithm via the same reduction.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Learning To Count Objects in Images
Victor Lempitsky,Andrew Zisserman +1 more
- 06 Dec 2010
TL;DR: This work focuses on the practically-attractive case when the training images are annotated with dots, and introduces a new loss function, which is well-suited for visual object counting tasks and at the same time can be computed efficiently via a maximum subarray algorithm.
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
TL;DR: Generic equivalences between matrix products over a large class of algebraic structures used in optimization, verifying a matrix product over the same structure, and corresponding triangle detection problems over the structure are shown.
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
TL;DR: An efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array that correlates two parameters involved in data, such as ages and income for the amount of sales per some period is designed.
106
Efficient algorithms for subwindow search in object detection and localization
Senjian An,Patrick Peursum,Wanquan Liu,Svetha Venkatesh +3 more
- 20 Jun 2009
TL;DR: Two significantly faster methods based on the linear-time Kadane's Algorithm for 1D maximum subarray search are presented, one of which is a novel, computationally superior branch-and-bound method and the other an approximate algorithm based on alternating search, whose computational complexity is typically O(n2).
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application
Tadao Takaoka
- 17 Aug 2004
TL;DR: A faster algorithm for the all-pairs shortest path problem under the RAM model, based on distance matrix multiplication (DMM), and extends the algorithm to a parallel algorithm for DMM, whose time complexity is O(log n) and number of processors is T(n)/log n.
51
References
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Matrix multiplication via arithmetic progressions
Don Coppersmith,Shmuel Winograd +1 more
TL;DR: In this article, a new method for accelerating matrix multiplication asymptotically is presented, based on the ideas of Volker Strassen, by using a basic trilinear form which is not a matrix product.
2.6K
A new upper bound on the complexity of the all pairs shortest path problem
TL;DR: A new algorithm is invented for the all pairs shortest path problem with O (n 3 ( log log n log n ) time on a unifor RAM) by an improvement of Fredman's result by a factor of 1.6.
135
Programming pearls: perspective on performance
TL;DR: This column is about the opportunities for efficiency at various design levels of a computer system: each technique is applicable to one of several design levels at which computer systems are built.
81