Sciweavers

    36 search results - page 2 / 8
    » spaa 2009
    Sort
    View
    SPAA
    2009
    ACM
    196views Distributed And Parallel Com...» more  SPAA 2009»
    Reducers and other Cilk++ hyperobjects
    14 years 5 months ago
    Reducers and other Cilk++ hyperobjects
    Download  www.cs.utk.edu
    Matteo Frigo, Pablo Halpern, Charles E. Leiserson,...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    138views Distributed And Parallel Com...» more  SPAA 2009»
    On the complexity of the regenerator placement problem in optical networks
    14 years 2 months ago
    On the complexity of the regenerator placement problem in optical networks
    Download  www-sop.inria.fr
    Michele Flammini, Alberto Marchetti-Spaccamela, Gi...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    145views Distributed And Parallel Com...» more  SPAA 2009»
    Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
    14 years 5 months ago
    Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
    Download  gauss.cs.ucsb.edu
    Aydin Buluç, Jeremy T. Fineman, Matteo Frig...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    160views Distributed And Parallel Com...» more  SPAA 2009»
    Approximation algorithms for time-constrained scheduling on line networks
    14 years 5 months ago
    Approximation algorithms for time-constrained scheduling on line networks
    Download  www.dcs.warwick.ac.uk
    We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
    Harald Räcke, Adi Rosén
    claim paper
    Read More »
    SPAA
    2009
    ACM
    135views Distributed And Parallel Com...» more  SPAA 2009»
    An optimal local approximation algorithm for max-min linear programs
    14 years 5 months ago
    An optimal local approximation algorithm for max-min linear programs
    Download  www.cs.helsinki.fi
    In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
    Patrik Floréen, Joel Kaasinen, Petteri Kask...
    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.