Simplex communication

Known as: Simplex, Simplex circuit, Simplex channel 
Simplex communication is a communication channel that sends information in one direction only. The International Telecommunication Union definition… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
020040060019362016

Papers overview

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)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Given a set of mixed spectral (multispectral or hyperspectral) vectors, linear spectral mixture analysis, or linear unmixing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
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
We introduce the <italic>smoothed analysis of algorithms</italic>, which is a hybrid of the worst-case and average-case analysis… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
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
The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
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
We propose a data structure to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
 
  • figure 2
  • figure 3
  • figure 6
  • figure I
  • table 1
Is this relevant?