Sciweavers

    611 search results - page 5 / 123
    » Yuri, Logic, and Computer Science
    Sort
    View
    FOCS
    2007
    IEEE
    135views Theoretical Computer Science» more  FOCS 2007»
    On the Advantage over Random for Maximum Acyclic Subgraph
    15 years 6 months ago
    On the Advantage over Random for Maximum Acyclic Subgraph
    Download  www.cs.princeton.edu
    In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
    Moses Charikar, Konstantin Makarychev, Yury Makary...
    claim paper
    Read More »
    80
    Voted
    SYNTHESE
    2008
    88views more  SYNTHESE 2008»
    Interpolation in computing science: the semantics of modularization
    14 years 11 months ago
    Interpolation in computing science: the semantics of modularization
    Download  www.springerlink.com
    The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
    Gerard R. Renardel de Lavalette
    claim paper
    Read More »
    110
    Voted
    ICYCS
    2008
    IEEE
    222views Theoretical Computer Science» more  ICYCS 2008»
    Introduction to the Reform on the Course of Fundamental Logic and Computer Design
    15 years 6 months ago
    Introduction to the Reform on the Course of Fundamental Logic and Computer Design
    Download  www.cs.zju.edu.cn
    Qingsong Shi, Wei Hu, Sha Liu, Tianzhou Chen
    claim paper
    Read More »
    72
    Voted
    SOFSEM
    2010
    Springer
    137views Theoretical Computer Science» more  SOFSEM 2010»
    Comparison of Scoring and Order Approach in Description Logic EL(D)
    15 years 8 months ago
    Comparison of Scoring and Order Approach in Description Logic EL(D)
    Download  www.sofsem.cz
    Veronika Vaneková, Peter Vojtás
    claim paper
    Read More »
    SOFSEM
    2010
    Springer
    115views Theoretical Computer Science» more  SOFSEM 2010»
    Taming the Complexity of Inductive Logic Programming
    15 years 8 months ago
    Taming the Complexity of Inductive Logic Programming
    Download  www.sofsem.cz
    Filip Zelezný, Ondrej Kuzelka
    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-2025, USA.