Sciweavers

    2542 search results - page 509 / 509
    » Computing Cartograms with Optimal Complexity
    Sort
    View
    FSTTCS
    2009
    Springer
    135views Software Engineering» more  FSTTCS 2009»
    Fractional Pebbling and Thrifty Branching Programs
    13 years 12 months ago
    Fractional Pebbling and Thrifty Branching Programs
    Download  www.cs.toronto.edu
    We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
    Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
    claim paper
    Read More »
    STOC
    2009
    ACM
    271views Algorithms» more  STOC 2009»
    A fast and efficient algorithm for low-rank approximation of a matrix
    14 years 6 months ago
    A fast and efficient algorithm for low-rank approximation of a matrix
    Download  thanglong.ece.jhu.edu
    The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
    Nam H. Nguyen, Thong T. Do, Trac D. Tran
    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.