Sciweavers

    2766 search results - page 7 / 554
    » Algorithms for trigonometric polynomials
    Sort
    View
    MKM
    2009
    Springer
    144views Information Technology» more  MKM 2009»
    Algorithms for the Functional Decomposition of Laurent Polynomials
    14 years 3 months ago
    Algorithms for the Functional Decomposition of Laurent Polynomials
    Download  www.csd.uwo.ca
    Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
    Stephen M. Watt
    claim paper
    Read More »
    STOC
    2006
    ACM
    76views Algorithms» more  STOC 2006»
    A polynomial quantum algorithm for approximating the Jones polynomial
    14 years 8 months ago
    A polynomial quantum algorithm for approximating the Jones polynomial
    Download  www.cs.huji.ac.il
    Dorit Aharonov, Vaughan Jones, Zeph Landau
    claim paper
    Read More »
    SDM
    2009
    SIAM
    161views Data Mining» more  SDM 2009»
    Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
    14 years 5 months ago
    Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
    Download  www-ikn.ist.hokudai.ac.jp
    In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
    Hiroki Arimura, Takeaki Uno
    claim paper
    Read More »
    PAKDD
    2009
    ACM
    118views Data Mining» more  PAKDD 2009»
    A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences
    14 years 1 months ago
    A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences
    Download  www-ikn.ist.hokudai.ac.jp
    Takashi Katoh, Hiroki Arimura, Kouichi Hirata
    claim paper
    Read More »
    SODA
    2000
    ACM
    120views Algorithms» more  SODA 2000»
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
    13 years 9 months ago
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
    Download  people.commerce.ubc.ca
    This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
    S. Thomas McCormick, Akiyoshi Shioura
    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.