Sciweavers

    6 search results - page 2 / 2
    » Sorting and Counting Networks of Small Depth and Arbitrary W...
    Sort
    View
    SPAA
    2009
    ACM
    129views Distributed And Parallel Com...» more  SPAA 2009»
    A randomized, o(log w)-depth 2 smoothing network
    14 years 2 months ago
    A randomized, o(log w)-depth 2 smoothing network
    Download  aeolus.ceid.upatras.gr
    A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
    Marios Mavronicolas, Thomas Sauerwald
    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.