Sciweavers

    EACL
    2009
    ACL Anthology
    123views Natural Language Processing» more  EACL 2009»
    Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
    13 years 10 months ago
    Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
    Download  www.aclweb.org
    like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
    Stephen Wan, Mark Dras, Robert Dale, Cécile...
    claim paper
    Read More »
    GAMESEC
    2010
    139views Game Theory» more  GAMESEC 2010»
    Design of Network Topology in an Adversarial Environment
    13 years 10 months ago
    Design of Network Topology in an Adversarial Environment
    Download  www.eecs.berkeley.edu
    We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
    Assane Gueye, Jean C. Walrand, Venkat Anantharam
    claim paper
    Read More »
    PPSN
    2010
    Springer
    141views Distributed And Parallel Com...» more  PPSN 2010»
    Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
    13 years 11 months ago
    Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
    Download  www2.imm.dtu.dk
    Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
    Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
    claim paper
    Read More »
    IJCM
    2002
    92views more  IJCM 2002»
    Random-tree Diameter and the Diameter-constrained MST
    14 years 15 days ago
    Random-tree Diameter and the Diameter-constrained MST
    Download  www.cs.ucf.edu
    A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
    Ayman Abdalla, Narsingh Deo
    claim paper
    Read More »
    JUCS
    2007
    148views more  JUCS 2007»
    Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
    14 years 18 days ago
    Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
    Download  www.jucs.org
    : We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
    Adrian Dumitrescu, Csaba D. Tóth
    claim paper
    Read More »
    IPL
    2007
    114views more  IPL 2007»
    Spanning trees with minimum weighted degrees
    14 years 19 days ago
    Spanning trees with minimum weighted degrees
    Download  www.andrew.cmu.edu
    Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
    Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
    claim paper
    Read More »
    CPC
    2007
    97views more  CPC 2007»
    On an Online Spanning Tree Problem in Randomly Weighted Graphs
    14 years 21 days ago
    On an Online Spanning Tree Problem in Randomly Weighted Graphs
    Download  www.cadmo.ethz.ch
    Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
    Jan Remy, Alexander Souza, Angelika Steger
    claim paper
    Read More »
    EOR
    2006
    130views more  EOR 2006»
    A Benders decomposition approach for the robust spanning tree problem with interval data
    14 years 22 days ago
    A Benders decomposition approach for the robust spanning tree problem with interval data
    Download  www.idsia.ch
    The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
    Roberto Montemanni
    claim paper
    Read More »
    COMBINATORICS
    2006
    153views more  COMBINATORICS 2006»
    The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
    14 years 23 days ago
    The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
    Download  www.maths.tcd.ie
    A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
    T. R. Riley, William P. Thurston
    claim paper
    Read More »
    DM
    2010
    86views more  DM 2010»
    Minimum congestion spanning trees in planar graphs
    14 years 24 days ago
    Minimum congestion spanning trees in planar graphs
    Download  facpub.stjohns.edu
    : The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate th...
    M. I. Ostrovskii
    claim paper
    Read More »
    123456next ›last »
    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.