Sciweavers

    ISAAC
    2005
    Springer
    85views Algorithms» more  ISAAC 2005»

    Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition

    13 years 10 months ago
    Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition
    Download  www.cs.purdue.edu
    Erdong Chen, Hao Yuan, Linji Yang
    claim paper
    Added 27 Jun 2010
    Updated 27 Jun 2010
    Type Conference
    Year 2005
    Where ISAAC
    Authors Erdong Chen, Hao Yuan, Linji Yang
    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.