Sciweavers

    2 search results - page 1 / 1
    » Efficient Ming of Top-K Closed Sequences
    Sort
    View
    JCIT
    2010
    174views more  JCIT 2010»
    Efficient Ming of Top-K Closed Sequences
    12 years 11 months ago
    Efficient Ming of Top-K Closed Sequences
    Download  www.aicit.org
    Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
    Panida Songram
    claim paper
    Read More »
    ICA3PP
    2009
    Springer
    138views Distributed And Parallel Com...» more  ICA3PP 2009»
    Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
    13 years 9 months ago
    Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
    Download  oplab.im.ntu.edu.tw
    We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed...
    Ming-Tsung Hsu, Frank Yeong-Sung Lin, Yue-Shan Cha...
    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.