Sciweavers

    CORR
    2016
    Springer
    44views Education» more  CORR 2016»

    Computing approximate PSD factorizations

    8 years 8 months ago
    Computing approximate PSD factorizations
    Download  www.ams.jhu.edu
    Abstract. We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error.
    Amitabh Basu, Michael Dinitz, Xin Li 0006
    claim paper
    Added 31 Mar 2016
    Updated 31 Mar 2016
    Type Journal
    Year 2016
    Where CORR
    Authors Amitabh Basu, Michael Dinitz, Xin Li 0006
    Comments (0)
    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.