Sciweavers

    ENTCS
    2002
    207views more  ENTCS 2002»
    Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
    13 years 4 months ago
    Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
    Download  www.cosc.canterbury.ac.nz
    We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
    Tadao Takaoka
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.