Sciweavers

    206 search results - page 42 / 42
    » Analysis of A Loss-Resilient Proactive Data Transmission Pro...
    Sort
    View
    DIALM
    2007
    ACM
    178views Algorithms» more  DIALM 2007»
    Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
    13 years 8 months ago
    Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
    Download  www.cn.uni-duesseldorf.de
    Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
    Björn Scheuermann, Martin Mauve
    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.