Journal of Algorithms

Paper

01 Jan 1983

Minimal algorithms for bilinear forms may have divisions

View publication

Abstract

We present a minimal algorithm for computing a set of bilinear forms which uses divisions. © 1983.

Related

Paper

Modified ffts for fused multiply-add architectures

Elliot Linzer, Ephraim Feig

Mathematics of Computation

Paper

A block-based gradient descent search algorithm for block motion estimation in video coding

Lurng-Kuo Liu, Ephraim Feig

IEEE TCSVT

Paper

Motion optimization of ordered blocks for overlapped block motion compensation

Rajesh Rajagopalan, Ephraim Feig, et al.

IEEE TCSVT

Paper

Implementation of Efficient Fft Algorithms on Fused Multiply-Add Architectures

Elliot N. Linzer, Ephraim Feig

IEEE TSP

View all publications