Sciweavers

    2 search results - page 1 / 1
    » The average-case complexity of counting distinct elements
    Sort
    View
    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 »
    COCO
    2009
    Springer
    131views Algorithms» more  COCO 2009»
    A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
    13 years 11 months ago
    A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
    Download  www.cs.dartmouth.edu
    —The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
    Joshua Brody, Amit Chakrabarti
    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.