Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Hoffman, A.
Mannos, M.
Sokolowsky, D.
and
Wiegmann, N.
1953.
Computational Experience in Solving Linear Programs.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 1,
Issue. 1,
p.
17.
Motzkin, T. S.
and
Schoenberg, I. J.
1954.
The Relaxation Method for Linear Inequalities.
Canadian Journal of Mathematics,
Vol. 6,
Issue. ,
p.
393.
Todd, John
1955.
Motivation for working in numerical analysis.
Communications on Pure and Applied Mathematics,
Vol. 8,
Issue. 1,
p.
97.
Highleyman, W.
1962.
Linear Decision Functions, with Application to Pattern Recognition.
Proceedings of the IRE,
Vol. 50,
Issue. 6,
p.
1501.
Merzlyakov, Yu.I.
1963.
On a relaxation method of solving systems of linear inequalities.
USSR Computational Mathematics and Mathematical Physics,
Vol. 2,
Issue. 3,
p.
504.
Miller, Keith
1964.
Three circle theorems in partial differential equations and applications to improperly posed problems.
Archive for Rational Mechanics and Analysis,
Vol. 16,
Issue. 2,
p.
126.
Mays, C. Hugh
1964.
Effects of Adaptation Parameters on Convergence Time and Tolerance for Adaptive Threshold Elements.
IEEE Transactions on Electronic Computers,
Vol. EC-13,
Issue. 4,
p.
465.
Mays, C. Hugh
1965.
The Relationship of Algorithms Used with Adjustable Threshold Elements to Differential Equations.
IEEE Transactions on Electronic Computers,
Vol. EC-14,
Issue. 1,
p.
62.
Ho, Y-C.
and
Kashyap, R. L.
1965.
An Algorithm for Linear Inequalities and its Applications.
IEEE Transactions on Electronic Computers,
Vol. EC-14,
Issue. 5,
p.
683.
Wong, E
and
Eisenberg, E
1965.
Iterative synthesis of threshold functions.
Journal of Mathematical Analysis and Applications,
Vol. 11,
Issue. ,
p.
226.
Ablow, C.
and
Kaylor, D.
1965.
A committee solution of the pattern recognition problem (Corresp.).
IEEE Transactions on Information Theory,
Vol. 11,
Issue. 3,
p.
453.
Duda, R. O.
and
Fossum, H.
1966.
Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions.
IEEE Transactions on Electronic Computers,
Vol. EC-15,
Issue. 2,
p.
220.
Smith, F.
1966.
A trainable nonlinear function generator.
IEEE Transactions on Automatic Control,
Vol. 11,
Issue. 2,
p.
212.
Ho, Yu-Chi
and
Kashyap, R. L.
1966.
A Class of Iterative Procedures for Linear Inequalities.
SIAM Journal on Control,
Vol. 4,
Issue. 1,
p.
112.
Suzuki, Tatsuro
and
Yonezawa, Seiji
1966.
System of Simultaneous Nonlinear Inequalities and Automatic Lens-Design Method.
Journal of the Optical Society of America,
Vol. 56,
Issue. 5,
p.
677.
Germanov, M.A.
and
Spiridonov, V.S.
1966.
On a method of solving systems of non-linear inequalities.
USSR Computational Mathematics and Mathematical Physics,
Vol. 6,
Issue. 2,
p.
194.
Butz, Arthur R
1967.
Perceptron type learning algorithms in nonseparable situations.
Journal of Mathematical Analysis and Applications,
Vol. 17,
Issue. 3,
p.
560.
Bregman, L.M.
1967.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming.
USSR Computational Mathematics and Mathematical Physics,
Vol. 7,
Issue. 3,
p.
200.
Willner, Leopold B.
1968.
On the distance between polytopes.
Quarterly of Applied Mathematics,
Vol. 26,
Issue. 2,
p.
207.
Wee, W.
1968.
A survey of pattern recognition.
p.
25.