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

2013

Highly Cited

2013

A multiplicity of autonomous terminals simultaneously transmits data streams to a compact array of antennas. The array uses… Expand

Highly Cited

2008

Highly Cited

2008

Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal… Expand

Highly Cited

2006

Highly Cited

2006

A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on… Expand

Highly Cited

2000

Highly Cited

2000

Abstract While principal component analysis (PCA) has found wide application in process monitoring, slow and normal process… Expand

Highly Cited

1987

Highly Cited

1987

Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module… Expand

Highly Cited

1973

Highly Cited

1973

An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf… Expand

Highly Cited

1972

Highly Cited

1972

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum… Expand

Highly Cited

1970

Highly Cited

1970

An approximate method for rapid multiplication or division with relatively simple digital circuitry is described. The algorithm… Expand

Highly Cited

1970

Highly Cited

1970

It is shown in this paper that the discrete equivalent of a chirp filter is needed to implement the computation of the discrete… Expand

Highly Cited

1962

Highly Cited

1962

A method of computer multiplication and division is proposed which uses binary logarithms. The logarithm of a binary number may… Expand