Simplex communication is a communication channel that sends information in one direction only. The International Telecommunication Union definitionâ€¦Â (More)

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

Highly Cited

2008

Highly Cited

2008

Nicholas J. Higham â€œThis superb book is timely and is written with great attention paid to detail, particularly in itsâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Introduction. The problem discussed in this paper was formulated by T. Harris as follows: "Consider a rail network connecting twoâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- JosÃ© M. P. Nascimento, José M. Bioucas-Dias
- IEEE Transactions on Geoscience and Remoteâ€¦
- 2005

Given a set of mixed spectral (multispectral or hyperspectral) vectors, linear spectral mixture analysis, or linear unmixingâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Amir Beck, Marc Teboulle
- Oper. Res. Lett.
- 2003

The mirror descent algorithm (MDA) was introduced by Nemirovsky and Yudin for solving convex optimization problems. This methodâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Daniel A. Spielman, Shang-Hua Teng
- STOC
- 2001

We introduce the <italic>smoothed analysis of algorithms</italic>, which is a hybrid of the worst-case and average-case analysisâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Dr. Zbigniew Michalewicz, Dr. David B. Fogel
- Springer Berlin Heidelberg
- 2000

This book is the only source that provides comprehensive, current, and correct information on problem solving using modernâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright
- SIAM Journal on Optimization
- 1998

The Nelderâ€“Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensionalâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- David Haussler, Emo Welzl
- Symposium on Computational Geometry
- 1986

We present a new technique for half-space and simplex range query using <italic>&Ogr;</italic>(<italic>n</italic>) space andâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Daniel Dominic Sleator, Robert E. Tarjan
- STOC
- 1981

We propose a data structure to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: aâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- Theor. Comput. Sci.
- 1976

Â

Is this relevant?