Sciweavers

    ANCS
    2009
    ACM
    162views Computer Networks» more  ANCS 2009»
    SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
    13 years 9 months ago
    SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
    Download  s-router.cs.tsinghua.edu.cn
    Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
    Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
    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.