Sciweavers

    4255 search results - page 827 / 851
    » Cover
    Sort
    View
    86
    Voted
    SIAMCOMP
    1998
    125views more  SIAMCOMP 1998»
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results
    14 years 9 months ago
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results
    Download  www.cse.buffalo.edu
    This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
    Mihir Bellare, Oded Goldreich, Madhu Sudan
    claim paper
    Read More »
    87
    Voted
    SIAMCOMP
    1998
    114views more  SIAMCOMP 1998»
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    14 years 9 months ago
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    Download  www.math.tu-berlin.de
    A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
    Stefan Felsner, Lorenz Wernisch
    claim paper
    Read More »
    TC
    1998
    158views Information Technology» more  TC 1998»
    Abstraction Techniques for Validation Coverage Analysis and Test Generation
    14 years 9 months ago
    Abstraction Techniques for Validation Coverage Analysis and Test Generation
    Download  cadal.cse.nsysu.edu.tw
    ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
    Dinos Moundanos, Jacob A. Abraham, Yatin Vasant Ho...
    claim paper
    Read More »
    TCAD
    1998
    86views more  TCAD 1998»
    Fast heuristic and exact algorithms for two-level hazard-free logic minimization
    14 years 9 months ago
    Fast heuristic and exact algorithms for two-level hazard-free logic minimization
    Download  www.cs.columbia.edu
    None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
    Michael Theobald, Steven M. Nowick
    claim paper
    Read More »
    SIAMJO
    2002
    92views more  SIAMJO 2002»
    Generalized Bundle Methods
    14 years 9 months ago
    Generalized Bundle Methods
    Download  www.di.unipi.it
    We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
    Antonio Frangioni
    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.