Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2005

Highly Cited

2005

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic… Expand

Highly Cited

2004

Highly Cited

2004

In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1) spatio-temporal trajectory with a low order… Expand

Highly Cited

2004

Highly Cited

2004

This paper presents a new technique for studying the stability properties of dynamic systems modeled by delay-differential… Expand

Highly Cited

2003

Highly Cited

2003

In this chapter we show how Chebyshev polynomials and some of their fundamental properties can be made to play an important part… Expand

Highly Cited

2000

Highly Cited

2000

We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids… Expand

Highly Cited

1995

Highly Cited

1995

Efficient direct solvers based on the Chebyshev–Galerkin methods for second- and fourth-order equations are presented. They are… Expand

1993

1993

Abstract Chebyshev polynomials of the third and fourth kinds, orthogonal with respect to (1 + x) 1 2 (1 − x)− 1 2 and (1 − x) 1 2… Expand

Highly Cited

1989

Highly Cited

1989

A computation is a temptation that should be resisted as long as possible. "

Highly Cited

1970

Highly Cited

1963

Highly Cited

1963

These notes cover the basic definitions of discrete probability theory, and then present some results including Bayes' rule… Expand