In mathematics, a polynomial basis is basis of a polynomial ring, viewed as a vector space over the field of coefficients, or as a free module over… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2012

Review

2012

- Rida T. Farouki
- Computer Aided Geometric Design
- 2012

One hundred years after the introduction of the Bernstein polynomial basis, we survey the historical development and current… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- George Konidaris, Sarah Osentoski, Philip S. Thomas
- AAAI
- 2011

We describe the Fourier basis, a linear value function approximation scheme based on the Fourier series. We empirically… (More)

Is this relevant?

2007

2007

- Siavash Bayat Sarmadi, M. Anwar Hasan
- IEEE Transactions on Very Large Scale Integration…
- 2007

The detection of errors in arithmetic operations is an important issue. This paper discusses the detection of multiple-bit errors… (More)

Is this relevant?

2005

2005

- Christophe Nègre
- International Conference on Information…
- 2005

Finite field arithmetic has advantageous space and time complexity when the field is constructed with a sparse polynomial. Katti… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Arash Reyhani-Masoleh, M. Anwar Hasan
- IEEE Transactions on Computers
- 2004

Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for… (More)

Is this relevant?

2003

2003

In paper [4], transformation matrices mapping the Legendre and Bernstein forms of a polynomial of degree n into each other are… (More)

Is this relevant?

2002

2002

- Arash Reyhani-Masoleh, M. Anwar Hasan
- CHES
- 2002

In many of cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its… (More)

Is this relevant?

2001

2001

- Erik Frisk, Mattias Nyberg
- Automatica
- 2001

A fundamental part of a fault diagnosis system is the residual generator. Here a new method, the minimal polynomial basis… (More)

Is this relevant?

1999

1999

- Huapeng Wu
- CHES
- 1999

Bit-parallel finite field multiplication in F2m using polynomial basis can be realized in two steps: polynomial multiplication… (More)

Is this relevant?

1993

1993

- Mu-Song Chen, Michael T. Manry
- IEEE Trans. Neural Networks
- 1993

A technique for modeling the multilayer perceptron (MLP) neural network, in which input and hidden units are represented by… (More)

Is this relevant?