Sciweavers

    COLT
    1998
    Springer
    86views Machine Learning» more  COLT 1998»

    The Query Complexity of Finding Local Minima in the Lattice

    14 years 4 months ago
    The Query Complexity of Finding Local Minima in the Lattice
    Download  www.cs.bgu.ac.il
    Amos Beimel, Felix Geller, Eyal Kushilevitz
    claim paper
    Added 05 Aug 2010
    Updated 05 Aug 2010
    Type Conference
    Year 1998
    Where COLT
    Authors Amos Beimel, Felix Geller, Eyal Kushilevitz
    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.