Sciweavers

    13214 search results - page 21 / 2643
    » Pseudorandomness for network algorithms
    Sort
    View
    NETWORKS
    2007
    77views Computer Networks» more  NETWORKS 2007»
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    15 years 6 months ago
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    Download  www.cs.uoi.gr
    Katerina Asdre, Stavros D. Nikolopoulos
    claim paper
    Read More »
    NETWORKS
    2010
    321views Computer Networks» more  NETWORKS 2010»
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    15 years 4 months ago
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    Download  www.euro-online.org
    Giulia Galbiati, Stefano Gualandi, Francesco Maffi...
    claim paper
    Read More »
    CTRSA
    2010
    Springer
    169views Cryptology» more  CTRSA 2010»
    Hash Function Combiners in TLS and SSL
    16 years 1 months ago
    Hash Function Combiners in TLS and SSL
    Download  www.cdc.informatik.tu-darmstadt.de
    Abstract. The TLS and SSL protocols are widely used to ensure secure communication over an untrusted network. Therein, a client and server first engage in the so-called handshake ...
    Marc Fischlin, Anja Lehmann, Daniel Wagner
    claim paper
    Read More »
    DFT
    2009
    IEEE
    106views VLSI» more  DFT 2009»
    Reducing Test Point Area for BIST through Greater Use of Functional Flip-Flops to Drive Control Points
    16 years 1 months ago
    Reducing Test Point Area for BIST through Greater Use of Functional Flip-Flops to Drive Control Points
    Download  users.ece.utexas.edu
    Recently, a new test point insertion method for pseudo-random built-in self-test (BIST) was proposed in [Yang 09] which tries to use functional flip-flops to drive control test po...
    Joon-Sung Yang, Benoit Nadeau-Dostie, Nur A. Touba
    claim paper
    Read More »
    DATE
    2008
    IEEE
    85views Hardware» more  DATE 2008»
    Improved Visibility in One-to-Many Trace Concretization
    16 years 29 days ago
    Improved Visibility in One-to-Many Trace Concretization
    Download  www.date-conference.com
    We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...
    Kuntal Nanshi, Fabio Somenzi
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.