Sciweavers

    7 search results - page 2 / 2
    » Maximum directed cuts in acyclic digraphs
    Sort
    View
    IPPS
    2007
    IEEE
    135views Distributed And Parallel Com...» more  IPPS 2007»
    Minimum number of wavelengths equals load in a DAG without internal cycle
    13 years 11 months ago
    Minimum number of wavelengths equals load in a DAG without internal cycle
    Download  aeolus.ceid.upatras.gr
    Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
    Jean-Claude Bermond, Michel Cosnard
    claim paper
    Read More »
    TIT
    2011
    149views more  TIT 2011»
    Network Coding for Computing: Cut-Set Bounds
    13 years 5 days ago
    Network Coding for Computing: Cut-Set Bounds
    Download  ieng9.ucsd.edu
    Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
    Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
    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.