Sciweavers

    NLP
    2000
    174views Natural Language Processing» more  NLP 2000»
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    13 years 8 months ago
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    Download  liawww.epfl.ch
    Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
    Jean-Cédric Chappelier, Martin Rajman
    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.