Sciweavers

    COCO
    2005
    Springer
    89views Algorithms» more  COCO 2005»
    Hardness of Max 3SAT with No Mixed Clauses
    13 years 10 months ago
    Hardness of Max 3SAT with No Mixed Clauses
    Download  www.cs.nyu.edu
    We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
    Venkatesan Guruswami, Subhash Khot
    claim paper
    Read More »
    WSDM
    2009
    ACM
    131views Data Mining» more  WSDM 2009»
    Diversifying search results
    13 years 11 months ago
    Diversifying search results
    Download  research.microsoft.com
    We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
    Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
    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.