Sciweavers

    COCOON
    2005
    Springer
    112views Combinatorics» more  COCOON 2005»
    Improved Algorithms for the K-Maximum Subarray Problem for Small K
    15 years 9 months ago
    Improved Algorithms for the K-Maximum Subarray Problem for Small K
    Download  www.cosc.canterbury.ac.nz
    The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
    Sung Eun Bae, Tadao Takaoka
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.