Sciweavers

    32 search results - page 3 / 7
    » spaa 2003
    Sort
    View
    SPAA
    2003
    ACM
    124views Distributed And Parallel Com...» more  SPAA 2003»
    Polynomial time algorithms for network information flow
    13 years 11 months ago
    Polynomial time algorithms for network information flow
    Download  web.mit.edu
    Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolh...
    claim paper
    Read More »
    SPAA
    2003
    ACM
    113views Distributed And Parallel Com...» more  SPAA 2003»
    Designing overlay multicast networks for streaming
    13 years 11 months ago
    Designing overlay multicast networks for streaming
    Download  www.akamai.com
    Konstantin Andreev, Bruce M. Maggs, Adam Meyerson,...
    claim paper
    Read More »
    SPAA
    2003
    ACM
    88views Distributed And Parallel Com...» more  SPAA 2003»
    Optimal fault-tolerant linear arrays
    13 years 11 months ago
    Optimal fault-tolerant linear arrays
    Download  www.lab.ss.titech.ac.jp
    This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
    Toshinori Yamada, Shuichi Ueno
    claim paper
    Read More »
    SPAA
    2003
    ACM
    114views Distributed And Parallel Com...» more  SPAA 2003»
    The complexity of verifying memory coherence
    13 years 11 months ago
    The complexity of verifying memory coherence
    Download  www.ece.wisc.edu
    The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
    Jason F. Cantin, Mikko H. Lipasti, James E. Smith
    claim paper
    Read More »
    SPAA
    2003
    ACM
    99views Distributed And Parallel Com...» more  SPAA 2003»
    A practical algorithm for constructing oblivious routing schemes
    13 years 11 months ago
    A practical algorithm for constructing oblivious routing schemes
    Download  www.ii.uni.wroc.pl
    In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
    Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
    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.