Sciweavers

    2 search results - page 1 / 1
    » Approximate shared-memory counting despite a strong adversar...
    Sort
    View
    TALG
    2010
    46views more  TALG 2010»
    Approximate shared-memory counting despite a strong adversary
    13 years 3 months ago
    Approximate shared-memory counting despite a strong adversary
    Download  www.cs.yale.edu
    James Aspnes, Keren Censor
    claim paper
    Read More »
    ICDT
    2009
    ACM
    147views Database» more  ICDT 2009»
    The average-case complexity of counting distinct elements
    14 years 5 months ago
    The average-case complexity of counting distinct elements
    Download  www.almaden.ibm.com
    We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
    David P. Woodruff
    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.