WorldCat Identities

Research Institute for Advanced Computer Science (U.S.)

Overview
Works: 354 works in 600 publications in 1 language and 20,741 library holdings
Classifications: QA76,
Publication Timeline
.
Most widely held works about Research Institute for Advanced Computer Science (U.S.)
 
Most widely held works by Research Institute for Advanced Computer Science (U.S.)
Using data tagging to improve the performance of Kanerva's sparse distributed memory by Research Institute for Advanced Computer Science (U.S.)( Book )

3 editions published in 1988 in English and held by 135 WorldCat member libraries worldwide

A parallel algorithm for the Eigenvalues and Eigenvectors of a general complex matrix by Gautam Shroff( Book )

1 edition published in 1989 in English and held by 125 WorldCat member libraries worldwide

Optimal expression evaluation for data parallel architectures by J. R Gilbert( Book )

1 edition published in 1990 in English and held by 121 WorldCat member libraries worldwide

Abstract: "A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. We give an efficient algorithm to find the minimum-cost way to evaluate an expression, for several different data parallel architectures
A class of designs for a sparse distributed memory by Research Institute for Advanced Computer Science (U.S.)( Book )

3 editions published in 1989 in English and held by 119 WorldCat member libraries worldwide

The ARPANET after twenty years by Peter J Denning( Book )

2 editions published in 1989 in English and held by 118 WorldCat member libraries worldwide

Sparse distributed memory by Peter J Denning( Book )

2 editions published in 1989 in English and held by 118 WorldCat member libraries worldwide

Modula-2* : an extension of Modula-2 for highly parallel programs by Walter F Tichy( Book )

2 editions published in 1989 in English and held by 118 WorldCat member libraries worldwide

Explicitly solvable complex Chebyshev approximation problems related to sine polynomials by Research Institute for Advanced Computer Science (U.S.)( Book )

2 editions published in 1989 in English and held by 117 WorldCat member libraries worldwide

Optimal Chebyshev polynomials on ellipses in the complex plane by Bernd Fischer( Book )

2 editions published in 1989 in English and held by 117 WorldCat member libraries worldwide

Neural networks and MIMD-multiprocessors by Research Institute for Advanced Computer Science (U.S.)( Book )

2 editions published in 1990 in English and held by 117 WorldCat member libraries worldwide

Numerical solution of large Lyapunov equations by Y Saad( Book )

2 editions published in 1989 in English and held by 116 WorldCat member libraries worldwide

Bayesian learning by Peter J Denning( Book )

2 editions published in 1989 in English and held by 116 WorldCat member libraries worldwide

Chebyshev polynomials are not always optimal by Bernd Fischer( Book )

1 edition published in 1989 in English and held by 116 WorldCat member libraries worldwide

We are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, we show that this is not true in general. Moreover, we derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented
Learning to read aloud : a neural network approach using sparse distributed memory by Umesh Dwarkenath Joglekar( Book )

1 edition published in 1989 in English and held by 116 WorldCat member libraries worldwide

Fast secant methods for the iterative solution of large nonsymmetric linear systems by Peter Deuflhard( Book )

1 edition published in 1990 in English and held by 116 WorldCat member libraries worldwide

A fast, preconditioned conjugate gradient Toeplitz solver by Victor Pan( Book )

2 editions published in 1989 in English and held by 116 WorldCat member libraries worldwide

On Bernstein type inequalities and a weighted Chebyshev approximation problem on ellipses by Roland W Freund( Book )

2 editions published in 1989 in English and held by 115 WorldCat member libraries worldwide

Policy issues in interconnecting networks by B Leiner( Book )

1 edition published in 1989 in English and held by 115 WorldCat member libraries worldwide

A survey of visual preprocessing and shape representation techniques by Bruno A Olshausen( Book )

4 editions published in 1988 in English and held by 83 WorldCat member libraries worldwide

Totally parallel multilevel algorithms by Paul O Frederickson( Book )

3 editions published in 1988 in English and held by 83 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.58 (from 0.51 for Totally pa ... to 0.70 for RIACS annu ...)

Alternative Names
Ames Research Center Research Institute for Advanced Computer Science

RIACS

United States Research Institute for Advanced Computer Science

Languages
English (43)