Sciweavers

    STOC
    1993
    ACM
    141views Algorithms» more  STOC 1993»
    Bounds for the computational power and learning complexity of analog neural nets
    14 years 3 months ago
    Bounds for the computational power and learning complexity of analog neural nets
    Download  www.igi.tugraz.at
    Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
    Wolfgang Maass
    claim paper
    Read More »
    STOC
    2009
    ACM
    145views Algorithms» more  STOC 2009»
    Finding, minimizing, and counting weighted subgraphs
    15 years 4 days ago
    Finding, minimizing, and counting weighted subgraphs
    Download  www.math.ias.edu
    d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
    Virginia Vassilevska, Ryan Williams
    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.