Sciweavers

    2 search results - page 1 / 1
    » A nearly-optimal index rule for scheduling of users with aba...
    Sort
    View
    INFOCOM
    2011
    IEEE
    175views Communications» more  INFOCOM 2011»
    A nearly-optimal index rule for scheduling of users with abandonment
    12 years 8 months ago
    A nearly-optimal index rule for scheduling of users with abandonment
    Download  www.bcamath.org
    —We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of lin...
    Urtzi Ayesta, Peter Jacko, Vladimir Novak
    claim paper
    Read More »
    VLDB
    1998
    ACM
    127views Database» more  VLDB 1998»
    Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
    13 years 8 months ago
    Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
    Download  www.vldb.org
    We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
    Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
    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.