Sciweavers

    57 search results - page 12 / 12
    » A Class of Probabilistic Automata with a Decidable Value 1 P...
    Sort
    View
    FOCS
    1995
    IEEE
    104views Theoretical Computer Science» more  FOCS 1995»
    Free Bits, PCPs and Non-Approximability - Towards Tight Results
    13 years 8 months ago
    Free Bits, PCPs and Non-Approximability - Towards Tight Results
    Download  cseweb.ucsd.edu
    This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
    Mihir Bellare, Oded Goldreich, Madhu Sudan
    claim paper
    Read More »
    UAI
    2003
    172views Artificial Intelligence» more  UAI 2003»
    On the Convergence of Bound Optimization Algorithms
    13 years 6 months ago
    On the Convergence of Bound Optimization Algorithms
    Download  cs.nyu.edu
    Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
    Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
    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.