Sciweavers

    101 search results - page 3 / 21
    » Improvement on the Decay of Crossing Numbers
    Sort
    View
    COMPGEOM
    2005
    ACM
    135views Discrete Geometry» more  COMPGEOM 2005»
    Abstract order type extension and new results on the rectilinear crossing number
    14 years 11 months ago
    Abstract order type extension and new results on the rectilinear crossing number
    Download  www.win.tue.nl
    Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
    Oswin Aichholzer, Hannes Krasser
    claim paper
    Read More »
    SDM
    2008
    SIAM
    165views Data Mining» more  SDM 2008»
    On the Dangers of Cross-Validation. An Experimental Evaluation
    14 years 11 months ago
    On the Dangers of Cross-Validation. An Experimental Evaluation
    Download  people.csail.mit.edu
    Cross validation allows models to be tested using the full training set by means of repeated resampling; thus, maximizing the total number of points used for testing and potential...
    R. Bharat Rao, Glenn Fung
    claim paper
    Read More »
    ESA
    2008
    Springer
    115views Algorithms» more  ESA 2008»
    A New Approach to Exact Crossing Minimization
    14 years 11 months ago
    A New Approach to Exact Crossing Minimization
    Download  ls11-www.cs.uni-dortmund.de
    The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
    Markus Chimani, Petra Mutzel, Immanuel M. Bomze
    claim paper
    Read More »
    WALCOM
    2010
    IEEE
    255views Algorithms» more  WALCOM 2010»
    A Global k-Level Crossing Reduction Algorithm
    15 years 4 months ago
    A Global k-Level Crossing Reduction Algorithm
    Download  www.infosun.fim.uni-passau.de
    Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
    Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
    claim paper
    Read More »
    COMPGEOM
    1996
    ACM
    111views Discrete Geometry» more  COMPGEOM 1996»
    On the Number of Arrangements of Pseudolines
    15 years 2 months ago
    On the Number of Arrangements of Pseudolines
    Download  www.math.tu-berlin.de
    Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
    Stefan Felsner
    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-2025, USA.