Sciweavers

    EJC
    2016
    70views Information Technology» more  EJC 2016»
    First-fit coloring on interval graphs has performance ratio at least 5
    10 years 1 days ago
    First-fit coloring on interval graphs has performance ratio at least 5
    Download  math.la.asu.edu
    First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
    Hal A. Kierstead, David A. Smith, William T. Trott...
    claim paper
    Read More »
    EJC
    2016
    69views Information Technology» more  EJC 2016»
    Constructions of transitive latin hypercubes
    10 years 1 days ago
    Constructions of transitive latin hypercubes
    Download  math.nsc.ru
    A function
    Denis S. Krotov, Vladimir N. Potapov
    claim paper
    Read More »
    106
    Voted
    EJC
    2016
    69views Information Technology» more  EJC 2016»
    Invariant measures via inverse limits of finite structures
    10 years 1 days ago
    Invariant measures via inverse limits of finite structures
    Download  math.mit.edu
    Abstract. Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrate...
    Nathanael Leedom Ackerman, Cameron E. Freer, Jaros...
    claim paper
    Read More »
    113
    Voted
    EJC
    2016
    68views Information Technology» more  EJC 2016»
    Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
    10 years 1 days ago
    Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
    Download  www.math.uiuc.edu
    Let C(n) denote the maximum number of induced copies of C5 in graphs on n vertices. For n large enough, we show that C(n) = a · b · c · d · e + C(a) + C(b) + C(c) + C(d) + C(e...
    József Balogh, Ping Hu, Bernard Lidick&yacu...
    claim paper
    Read More »
    102
    Voted
    EJC
    2016
    62views Information Technology» more  EJC 2016»
    A new line of attack on the dichotomy conjecture
    10 years 1 days ago
    A new line of attack on the dichotomy conjecture
    Download  www.math.ias.edu
    The well known dichotomy conjecture of Feder and Vardi states that for every family Γ of constraints CSP(Γ) is either polynomially solvable or NP-hard. Bulatov and Jeavons reform...
    Gábor Kun, Mario Szegedy
    claim paper
    Read More »
    All Subjects
    Algorithms
    Applied Computing
    Artificial Intelligence
    Augmented Reality
    Automated Reasoning
    Biometrics
    Communications
    Computational Geometry
    Computer Graphics
    Computer Networks
    Control Systems
    Cryptology
    Data Mining
    Database
    Distributed And Parallel Computing
    Education
    Emerging Technology
    Formal Methods
    FPGA
    Hardware
    Information Technology
    Intelligent Agents
    Internet Technology
    Knowledge Management
    Machine Learning
    Management
    Mathematics
    Medical Imaging
    Multimedia
    Natural Language Processing
    Neural Networks
    Operating System
    Operations Research
    Optimization
    Pattern Recognition
    Programming Languages
    Robotics
    Security Privacy
    Social Sciences
    Software Engineering
    Solid Modeling
    System Software
    Theoretical Computer Science
    VLSI
    Information Technology
    Top of PageReset Settings
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.