✦ LIBER ✦

On the Hyperplanes of the Taylor-Steinbuch Linear Separator

✍ Scribed by Sandoval, Victor H.

Book ID: 114587237
Publisher: Institute of Electrical and Electronics Engineers
Year: 1966
Tongue: English
Weight: 188 KB
Volume: EC-15
Category: Article
ISSN: 0367-7508
DOI: 10.1109/pgec.1966.264481

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Remarks on the separation of sets by a h

Remarks on the separation of sets by a hyperplane

✍ V. P. Dol'nikov 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 306 KB

The correctness of the linear closure of

The correctness of the linear closure of a family of recognition algorithms with separating hyperplanes

✍ A.S Dzyuba 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 632 KB

On the Consistency of a Separator

✍ Harper, J. P.; Rohwer, C. H. 📂 Article 📅 2010 🏛 Taylor and Francis Group 🌐 English ⚖ 182 KB

The minimal quantity of separating hyper

The minimal quantity of separating hyperplanes in a classification problem

✍ Yu. A. Zak; V. M. Kotlov 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 143 KB

Correctness of the linear closure of hyp

Correctness of the linear closure of hyperplane-based recognition algorithms

✍ E. I. Lysenok 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 325 KB

Hyperplane Sections of Grassmannians and

Hyperplane Sections of Grassmannians and the Number of MDS Linear Codes

✍ Sudhir R. Ghorpade; Gilles Lachaud 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 474 KB

We obtain some e!ective lower and upper bounds for the number of (n, k)-MDS linear codes over % O . As a consequence, one obtains an asymptotic formula for this number. These results also apply for the number of inequivalent representations over % O of the uniform matroid or, alternatively, the numb