Sciweavers

    995 search results - page 12 / 199
    » complexity 2011
    Sort
    View
    CORR
    2011
    Springer
    188views Education» more  CORR 2011»
    On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
    14 years 6 months ago
    On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
    Download  www.math.uzh.ch
    —The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
    Davide Schipani, Michele Elia, Joachim Rosenthal
    claim paper
    Read More »
    ACL
    2011
    178views Computational Linguistics» more  ACL 2011»
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    14 years 3 months ago
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
    Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
    claim paper
    Read More »
    TR
    2011
    106views more  TR 2011»
    Exploring Complex Systems Aspects of Blackout Risk and Mitigation
    14 years 6 months ago
    Exploring Complex Systems Aspects of Blackout Risk and Mitigation
    Download  www.ece.wisc.edu
    Abstract—Electric power transmission systems are a key infrastructure, and blackouts of these systems have major consequences for the economy and national security. Analyses of b...
    David E. Newman, Benjamin A. Carreras, Vickie E. L...
    claim paper
    Read More »
    CORR
    2011
    Springer
    174views Education» more  CORR 2011»
    Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
    14 years 6 months ago
    Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
    Download  drops.dagstuhl.de
    We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
    Georg Moser, Andreas Schnabl
    claim paper
    Read More »
    EXPERT
    2011
    160views more  EXPERT 2011»
    Introducing New Features to Wikipedia: Case Studies for Web Science
    14 years 6 months ago
    Introducing New Features to Wikipedia: Case Studies for Web Science
    Download  www.aifb.kit.edu
    Wikipedia is a free web-based encyclopedia. It is written in collaboration by hundred of thousands of contributors [2]. It runs on the Open Source MediaWiki wiki engine. Introduci...
    Mathias Schindler, Denny Vrandeccic
    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.