Sciweavers

    2766 search results - page 42 / 554
    » Algorithms for trigonometric polynomials
    Sort
    View
    94
    Voted
    JSC
    2002
    66views more  JSC 2002»
    Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
    15 years 3 months ago
    Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
    Download  comet.lehman.cuny.edu
    Victor Y. Pan
    claim paper
    Read More »
    81
    Voted
    NETWORKS
    1998
    62views Computer Networks» more  NETWORKS 1998»
    A polynomial algorithm for the p-centdian problem on a tree
    15 years 3 months ago
    A polynomial algorithm for the p-centdian problem on a tree
    Download  www.cs.ust.hk
    Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
    claim paper
    Read More »
    86
    Voted
    ICMS
    2010
    87views Software Engineering» more  ICMS 2010»
    New Algorithms for Computing Primary Decomposition of Polynomial Ideals
    15 years 2 months ago
    New Algorithms for Computing Primary Decomposition of Polynomial Ideals
    Download  www.math.kobe-u.ac.jp
    Masayuki Noro
    claim paper
    Read More »
    132
    Voted
    ACL
    2009
    107views Computational Linguistics» more  ACL 2009»
    A Polynomial-Time Parsing Algorithm for TT-MCTAG
    15 years 1 months ago
    A Polynomial-Time Parsing Algorithm for TT-MCTAG
    Download  www.aclweb.org
    This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
    Laura Kallmeyer, Giorgio Satta
    claim paper
    Read More »
    132
    Voted
    CORR
    2008
    Springer
    125views Education» more  CORR 2008»
    Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
    15 years 3 months ago
    Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
    Download  hal.archives-ouvertes.fr
    We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
    Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.