Sciweavers

    DCC
    2006
    IEEE
    86views Computer Graphics» more  DCC 2006»

    Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs

    13 years 8 months ago
    Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
    Download  www.cs.ust.hk
    Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far has
    Sorina Dumitrescu
    claim paper
    Related Content
    Added 22 Aug 2010
    Updated 22 Aug 2010
    Type Conference
    Year 2006
    Where DCC
    Authors Sorina Dumitrescu
    Comments (0)
    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.