Sciweavers

    3415 search results - page 7 / 683
    » Lower Bounds for Kernelizations
    Sort
    View
    FMCAD
    2004
    Springer
    142views Formal Methods» more  FMCAD 2004»
    Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
    14 years 3 months ago
    Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
    Download  vlsi.colorado.edu
    Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
    Mohammad Awedh, Fabio Somenzi
    claim paper
    Read More »
    BMCBI
    2006
    141views more  BMCBI 2006»
    Maximum common subgraph: some upper bound and lower bound results
    13 years 9 months ago
    Maximum common subgraph: some upper bound and lower bound results
    Download  www.biomedcentral.com
    Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
    Xiuzhen Huang, Jing Lai, Steven F. Jennings
    claim paper
    Read More »
    AMC
    2008
    94views more  AMC 2008»
    Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix
    13 years 9 months ago
    Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix
    Download  www.na.scitec.kobe-u.ac.jp
    Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson's bound, Brauer-type bound, Li's bound and Ostrowskitype boun...
    Yusaku Yamamoto
    claim paper
    Read More »
    AAIM
    2006
    Springer
    134views Algorithms» more  AAIM 2006»
    A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
    14 years 3 months ago
    A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
    Download  www.cs.uu.nl
    Emgad H. Bachoore, Hans L. Bodlaender
    claim paper
    Read More »
    FOCS
    2003
    IEEE
    122views Theoretical Computer Science» more  FOCS 2003»
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
    14 years 3 months ago
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
    Download  www.comp.nus.edu.sg
    Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    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.