Sciweavers

    6045 search results - page 76 / 1209
    » Computable Linearizations of Well-partial-orderings
    Sort
    View
    NAACL
    2010
    136views Computational Linguistics» more  NAACL 2010»
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    13 years 5 months ago
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
    Daniel Gildea
    claim paper
    Read More »
    COMCOM
    2011
    229views Computational Linguistics» more  COMCOM 2011»
    Palmtree: An IP alias resolution algorithm with linear probing complexity
    13 years 2 months ago
    Palmtree: An IP alias resolution algorithm with linear probing complexity
    Download  www.utdallas.edu
    Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
    M. Engin Tozal, Kamil Saraç
    claim paper
    Read More »
    COR
    2011
    195views Applied Computing» more  COR 2011»
    Faster integer-feasibility in mixed-integer linear programs by branching to force change
    13 years 2 months ago
    Faster integer-feasibility in mixed-integer linear programs by branching to force change
    Download  www.sce.carleton.ca
    Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
    Jennifer Pryor, John W. Chinneck
    claim paper
    Read More »
    COLING
    2010
    137views Computational Linguistics» more  COLING 2010»
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    13 years 2 months ago
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    Download  www.aclweb.org
    This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
    Laura Kallmeyer, Wolfgang Maier
    claim paper
    Read More »
    NA
    2011
    373views Computer Vision» more  NA 2011»
    On preconditioned MHSS iteration methods for complex symmetric linear systems
    13 years 2 months ago
    On preconditioned MHSS iteration methods for complex symmetric linear systems
    Download  www.mathcs.emory.edu
    We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...
    Zhong-Zhi Bai, Michele Benzi, Fang Chen
    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.