Sciweavers

    COLT
    2008
    Springer
    213views Machine Learning» more  COLT 2008»
    Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
    13 years 6 months ago
    Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
    Download  colt2008.cs.helsinki.fi
    A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
    Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
    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.