Sciweavers

    TCS
    2008
    116views Theoretical Computer Science» more  TCS 2008»
    On the complexity of real root isolation using continued fractions
    13 years 4 months ago
    On the complexity of real root isolation using continued fractions
    Download  www-sop.inria.fr
    We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
    Elias P. Tsigaridas, Ioannis Z. Emiris
    claim paper
    Read More »
    TCOM
    2008
    138views more  TCOM 2008»
    Determination of the Best CRC Codes with up to 10-Bit Redundancy
    13 years 4 months ago
    Determination of the Best CRC Codes with up to 10-Bit Redundancy
    Download  www.moi.math.bas.bg
    All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the e...
    Tsonka Stefanova Baicheva
    claim paper
    Read More »
    ADCM
    2005
    86views more  ADCM 2005»
    Interpolating polynomial wavelets on [-1, 1]
    13 years 4 months ago
    Interpolating polynomial wavelets on [-1, 1]
    Download  www.na.iac.cnr.it
    In the present paper polynomial interpolating scaling function and wavelets are constructed by using the interpolation properties of de la Vall
    M. R. Capobianco, Woula Themistoclakis
    claim paper
    Read More »
    AAECC
    2005
    Springer
    131views Algorithms» more  AAECC 2005»
    Noisy interpolation of sparse polynomials in finite fields
    13 years 4 months ago
    Noisy interpolation of sparse polynomials in finite fields
    Download  www.ricam.oeaw.ac.at
    Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
    Igor Shparlinski, Arne Winterhof
    claim paper
    Read More »
    NA
    2008
    78views more  NA 2008»
    Luigi Gatteschi's work on asymptotics of special functions and their zeros
    13 years 4 months ago
    Luigi Gatteschi's work on asymptotics of special functions and their zeros
    Download  www.cs.purdue.edu
    A good portion of Gatteschi's research publications--about 65%--is devoted to asymptotics of special functions and their zeros. Most prominently among the special functions st...
    Walter Gautschi, Carla Giordano
    claim paper
    Read More »
    MST
    2008
    141views more  MST 2008»
    From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
    13 years 4 months ago
    From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
    Download  www.cs.technion.ac.il
    Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
    Johann A. Makowsky
    claim paper
    Read More »
    ECCC
    2007
    100views more  ECCC 2007»
    Unconditional pseudorandom generators for low degree polynomials
    13 years 4 months ago
    Unconditional pseudorandom generators for low degree polynomials
    Download  www.theoryofcomputing.org
    Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
    Shachar Lovett
    claim paper
    Read More »
    DM
    2007
    98views more  DM 2007»
    p-adic valuations and k-regular sequences
    13 years 4 months ago
    p-adic valuations and k-regular sequences
    Download  people.math.sfu.ca
    A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
    Jason P. Bell
    claim paper
    Read More »
    DM
    2007
    72views more  DM 2007»
    Multicomplexes and polynomials with real zeros
    13 years 4 months ago
    Multicomplexes and polynomials with real zeros
    Download  people.math.sfu.ca
    We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
    Jason Bell, Mark Skandera
    claim paper
    Read More »
    JSCIC
    2008
    62views more  JSCIC 2008»
    Robustness of a Spline Element Method with Constraints
    13 years 4 months ago
    Robustness of a Spline Element Method with Constraints
    Download  www.math.niu.edu
    The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
    Gerard Awanou
    claim paper
    Read More »
    « first‹ previous12345678next ›last »
    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.