Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Todd, John
1955.
Motivation for working in numerical analysis.
Communications on Pure and Applied Mathematics,
Vol. 8,
Issue. 1,
p.
97.
Phelps, R. R.
1958.
Convex sets and nearest points. II.
Proceedings of the American Mathematical Society,
Vol. 9,
Issue. 6,
p.
867.
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.
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.
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.
Pomentale, T
1965.
A new method for solving conditioned maxima problems.
Journal of Mathematical Analysis and Applications,
Vol. 10,
Issue. 1,
p.
216.
Wong, E
and
Eisenberg, E
1965.
Iterative synthesis of threshold functions.
Journal of Mathematical Analysis and Applications,
Vol. 11,
Issue. ,
p.
226.
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.
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.
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.
Gubin, L.G.
Polyak, B.T.
and
Raik, E.V.
1967.
The method of projections for finding the common point of convex sets.
USSR Computational Mathematics and Mathematical Physics,
Vol. 7,
Issue. 6,
p.
1.
En, John
1968.
Rapid adaption procedures.
p.
38.
Eremin, I. I.
1968.
Methods of fejer's approximations in convex programming.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 3,
Issue. 2,
p.
139.
Spiridonov, V.S.
1968.
Application of the gradient relaxation method for the solution of systems of non-linear equations.
USSR Computational Mathematics and Mathematical Physics,
Vol. 8,
Issue. 4,
p.
231.
Ermol'ev, Yu. M.
1968.
Methods of solution of nonlinear extremal problems.
Cybernetics,
Vol. 2,
Issue. 4,
p.
1.
Mangasarian, O.
1968.
Multisurface method of pattern separation.
IEEE Transactions on Information Theory,
Vol. 14,
Issue. 6,
p.
801.
Willner, Leopold B.
1968.
On the distance between polytopes.
Quarterly of Applied Mathematics,
Vol. 26,
Issue. 2,
p.
207.
Nilsson, Nils J.
1969.
SURVEY OF PATTERN RECOGNITION.
Annals of the New York Academy of Sciences,
Vol. 161,
Issue. 2,
p.
380.
Mazurov, V. D.
1969.
The relaxation method for inconsistent systems of linear inequalities (The limit-point set).
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 5,
Issue. 4,
p.
270.