Sciweavers

    2 search results - page 1 / 1
    » Cryptographic Hardness for Learning Intersections of Halfspa...
    Sort
    View
    FOCS
    2006
    IEEE
    118views Theoretical Computer Science» more  FOCS 2006»
    Cryptographic Hardness for Learning Intersections of Halfspaces
    13 years 10 months ago
    Cryptographic Hardness for Learning Intersections of Halfspaces
    Download  userweb.cs.utexas.edu
    We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
    Adam R. Klivans, Alexander A. Sherstov
    claim paper
    Read More »
    ECCC
    2006
    97views more  ECCC 2006»
    Cryptographic Hardness Results for Learning Intersections of Halfspaces
    13 years 4 months ago
    Cryptographic Hardness Results for Learning Intersections of Halfspaces
    Download  www.cs.utexas.edu
    We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
    Adam R. Klivans, Alexander A. Sherstov
    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.