Sciweavers

    11 search results - page 3 / 3
    » A Random Polynomial Time Algorithm for Approximating the Vol...
    Sort
    View
    FOCS
    2007
    IEEE
    145views Theoretical Computer Science» more  FOCS 2007»
    Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
    13 years 10 months ago
    Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
    Download  www.cs.rochester.edu
    We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
    Daniel Stefankovic, Santosh Vempala, Eric Vigoda
    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.