Sciweavers

    CPC
    2016
    45views Artificial Intelligence» more  CPC 2016»
    On the Length of a Random Minimum Spanning Tree
    8 years 8 months ago
    On the Length of a Random Minimum Spanning Tree
    Download  www.math.cmu.edu
    We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen ...
    Colin Cooper, Alan M. Frieze, Nate Ince, Svante Ja...
    claim paper
    Read More »
    CPC
    2016
    67views Artificial Intelligence» more  CPC 2016»
    On the Chromatic Thresholds of Hypergraphs
    8 years 8 months ago
    On the Chromatic Thresholds of Hypergraphs
    Download  homepages.math.uic.edu
    József Balogh, Jane Butterfield, Ping Hu, J...
    claim paper
    Read More »
    CPC
    2016
    57views Artificial Intelligence» more  CPC 2016»
    Forcing a sparse minor
    8 years 8 months ago
    Forcing a sparse minor
    Download  users.monash.edu.au
    This paper addresses the following question for a given graph H: what is the minimum number f(H) such that every graph with average degree at least f(H) contains H as a minor? Due...
    Bruce A. Reed, David R. Wood
    claim paper
    Read More »
    CPC
    2016
    58views Artificial Intelligence» more  CPC 2016»
    The Satisfiability Threshold for k-XORSAT
    8 years 8 months ago
    The Satisfiability Threshold for k-XORSAT
    Download  eprints.lse.ac.uk
    We consider “unconstrained” random k-XORSAT, which is a uniformly random system of m linear non-homogeneous equations in F2 over n variables, each equation containing k ≥ 3 v...
    Boris Pittel, Gregory B. Sorkin
    claim paper
    Read More »
    CPC
    2016
    64views Artificial Intelligence» more  CPC 2016»
    Decomposition of Multiple Packings with Subquadratic Union Complexity
    8 years 8 months ago
    Decomposition of Multiple Packings with Subquadratic Union Complexity
    Download  www.math.nyu.edu
    Let k be a positive integer and let X be a k-fold packing of infinitely many simply connected compact sets in the plane, that is, assume that every point belongs to at most k sets...
    János Pach, Bartosz Walczak
    claim paper
    Read More »
    CPC
    2016
    48views Artificial Intelligence» more  CPC 2016»
    On Active and Passive Testing
    8 years 8 months ago
    On Active and Passive Testing
    Download  www.math.ias.edu
    Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property? This is a f...
    Noga Alon, Rani Hod, Amit Weinstein
    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.