Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

CJ
2006

66views more CJ 2006»

Improved Algorithms for the K-Maximum Subarray Problem

15 years 2 months ago

Improved Algorithms for the K-Maximum Subarray Problem

Download ir.canterbury.ac.nz

Sung Eun Bae, Tadao Takaoka

Real-time Traffic

CJ 2006 |

claim paper

Related Content

» Improved Algorithms for the k MaximumSums Problems

» A Subcubic Time Algorithm for the k Maximum Subarray Problem

» Improved Algorithms for the KMaximum Subarray Problem for Small K

» Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

» Efficient Algorithms for k Maximum Sums

» Approximation Algorithms for MinMax Generalization Problems

» Towards Optimal Range Medians

» Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CJ
Authors	Sung Eun Bae, Tadao Takaoka

Comments (0)