Sciweavers

    EMNLP
    2010
    129views Natural Language Processing» more  EMNLP 2010»
    Dual Decomposition for Parsing with Non-Projective Head Automata
    13 years 9 months ago
    Dual Decomposition for Parsing with Non-Projective Head Automata
    Download  www.aclweb.org
    This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
    Terry Koo, Alexander M. Rush, Michael Collins, Tom...
    claim paper
    Read More »
    TOC
    2008
    95views more  TOC 2008»
    On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
    13 years 11 months ago
    On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
    Download  theoryofcomputing.org
    : This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
    Viswanath Nagarajan
    claim paper
    Read More »
    IPL
    2007
    78views more  IPL 2007»
    LP-based solution methods for the asymmetric TSP
    13 years 11 months ago
    LP-based solution methods for the asymmetric TSP
    Download  www.math.ohiou.edu
    We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
    Vardges Melkonian
    claim paper
    Read More »
    CORR
    2007
    Springer
    128views Education» more  CORR 2007»
    Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
    13 years 11 months ago
    Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
    Download  www.mit.edu
    — Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
    Sujay Sanghavi
    claim paper
    Read More »
    4OR
    2008
    96views more  4OR 2008»
    A column generation approach to train timetabling on a corridor
    13 years 11 months ago
    A column generation approach to train timetabling on a corridor
    Download  arrival.cti.gr
    We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
    Valentina Cacchiani, Alberto Caprara, Paolo Toth
    claim paper
    Read More »
    SODA
    2003
    ACM
    121views Algorithms» more  SODA 2003»
    An improved approximation algorithm for the partial latin square extension problem
    14 years 24 days ago
    An improved approximation algorithm for the partial latin square extension problem
    Download  www.cs.cornell.edu
    Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
    Carla P. Gomes, Rommel G. Regis, David B. Shmoys
    claim paper
    Read More »
    IPCO
    2004
    110views Optimization» more  IPCO 2004»
    Scheduling an Industrial Production Facility
    14 years 25 days ago
    Scheduling an Industrial Production Facility
    Download  www.ru.is
    Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
    Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
    claim paper
    Read More »
    UAI
    2008
    226views Artificial Intelligence» more  UAI 2008»
    Tightening LP Relaxations for MAP using Message Passing
    14 years 26 days ago
    Tightening LP Relaxations for MAP using Message Passing
    Download  people.csail.mit.edu
    Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
    David Sontag, Talya Meltzer, Amir Globerson, Tommi...
    claim paper
    Read More »
    NIPS
    2007
    158views Information Technology» more  NIPS 2007»
    Linear programming analysis of loopy belief propagation for weighted matching
    14 years 26 days ago
    Linear programming analysis of loopy belief propagation for weighted matching
    Download  books.nips.cc
    Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
    Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
    claim paper
    Read More »
    IPCO
    2010
    152views Optimization» more  IPCO 2010»
    Hypergraphic LP Relaxations for Steiner Trees
    14 years 27 days ago
    Hypergraphic LP Relaxations for Steiner Trees
    Download  sma.epfl.ch
    We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
    Deeparnab Chakrabarty, Jochen Könemann, David...
    claim paper
    Read More »
    12next ›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.