Skip to search formSkip to main contentSkip to account menu>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…

Highly Cited

2011

Highly Cited

2011

Focusing on two-antenna infrastructure relays employed for coverage extension, we develop hybrid techniques that switch…

Highly Cited

2008

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…

Highly Cited

2000

Review

1990

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…

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…

Highly Cited

1972

Highly Cited

1972

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

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…