Sciweavers

    13603 search results - page 14 / 2721
    » On the Computational Complexity of Cut-Reduction
    Sort
    View
    COLING
    1999
    221views Computational Linguistics» more  COLING 1999»
    The Computational Complexity of the Correct-Prefix Property for TAGs
    13 years 8 months ago
    The Computational Complexity of the Correct-Prefix Property for TAGs
    Download  www.aclweb.org
    Mark-Jan Nederhof
    claim paper
    Read More »
    ACL
    2011
    233views Computational Linguistics» more  ACL 2011»
    Computing and Evaluating Syntactic Complexity Features for Automated Scoring of Spontaneous Non-Native Speech
    13 years 2 days ago
    Computing and Evaluating Syntactic Complexity Features for Automated Scoring of Spontaneous Non-Native Speech
    Download  www.aclweb.org
    Miao Chen, Klaus Zechner
    claim paper
    Read More »
    STOC
    1993
    ACM
    141views Algorithms» more  STOC 1993»
    Bounds for the computational power and learning complexity of analog neural nets
    14 years 15 days ago
    Bounds for the computational power and learning complexity of analog neural nets
    Download  www.igi.tugraz.at
    Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
    Wolfgang Maass
    claim paper
    Read More »
    WSC
    2004
    105views Modeling And Simulation» more  WSC 2004»
    A Generalized Multiple Response Surface Methodology for Complex Computer Simulation Applications
    13 years 9 months ago
    A Generalized Multiple Response Surface Methodology for Complex Computer Simulation Applications
    Download  www.informs-sim.org
    This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...
    Jeffrey B. Schamburg, Donald E. Brown
    claim paper
    Read More »
    TC
    2008
    109views Information Technology» more  TC 2008»
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    13 years 8 months ago
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    Download  eprint.iacr.org
    In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
    Francisco Rodríguez-Henríquez, Guill...
    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.