Partitions of N -Space by Hyperplanes
Robert O. Winder · SIAM Journal on Applied Mathematics · 1966
Previous article Next article Partitions of N-Space by HyperplanesR. O. WinderR. O. Winderhttps://doi.org/10.1137/0114068PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] S. H. Cameron, An estimate of the complexity requisite in a universal decision network, Bionics Symposium, Wright Air Development Division Report 60-600, 1960, 197–212 Google Scholar[2] T. M. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electronic Computers, EC-14 (1965), 326–334 0152.18206 CrossrefISIGoogle Scholar[3] D. T. Perkins, , D. G. Willis and , E. A. Whitmore, unpublished work at Lock-heed Aircraft Corporation, Missiles and Space Division, Sunnyvale, California Google Scholar[4] G. Polya, Induction and analogy in mathematics. Mathematics and plausible reasoning, vol. I, Princeton University Press, Princeton, N. J., 1954, 43–52 MR0066321 (16,556f) 0056.24101 Google Scholar[5] J. G. Wendel, A problem in geometric probability, Math. Scand., 11 (1962), 109–111 MR0146858 (26:4377) 0108.31603 CrossrefGoogle Scholar[6] R. O. Winder, Single stage threshold logicSwitching Circuit Theory and Logical Design, IEEE Publication S-134, New York, 1961, 321–332 CrossrefGoogle Scholar[7] R. O. Winder, Masters Thesis, Threshold logic, Doctoral Dissertation, Princeton University, University Microfilms, Ann Arbor, 1962 Google Scholar[8] R. O. Winder, Threshold logic in artificial intelligenceArtificial Intelligence, IEEE Publication S-142, New York, 1962, 107–128 Google Scholar[9] R. O. Winder, Bounds on threshold gate realizability, IEEE Trans. Electronic Computers, EC-12 (1963), 561–564 0203.15702 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails On lattice point counting in $$\varDelta $$-modular polyhedra25 May 2021 | Optimization Letters, Vol. 16, No. 7 Cross Ref MIMO Networks With One-Bit ADCs: Receiver Design and Communication StrategiesIEEE Transactions on Communications, Vol. 70, No. 3 Cross Ref Computation of projection regression depth and its induced medianComputational Statistics & Data Analysis, Vol. 158 Cross Ref The capacity of feedforward neural networksNeural Networks, Vol. 116 Cross Ref Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems Cross Ref The active bijection for graphsAdvances in Applied Mathematics, Vol. 104 Cross Ref Polynomial Threshold Functions, Hyperplane Arrangements, and Random TensorsPierre Baldi and Roman Vershynin8 October 2019 | SIAM Journal on Mathematics of Data Science, Vol. 1, No. 4AbstractPDF (523 KB)Querying a Collection of Continuous FunctionsIEEE Transactions on Knowledge and Data Engineering, Vol. 30, No. 9 Cross Ref The Exact Solution to Rank-1 L1-Norm TUCKER2 DecompositionIEEE Signal Processing Letters, Vol. 25, No. 4 Cross Ref McCulloch-Pitts Brains and Pseudorandom FunctionsNeural Computation, Vol. 28, No. 6 Cross Ref Exactly computing bivariate projection depth contours and medianComputational Statistics & Data Analysis, Vol. 60 Cross Ref Enumeration in torus arrangementsEuropean Journal of Combinatorics, Vol. 32, No. 6 Cross Ref Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications30 September 2009 | Discrete & Computational Geometry, Vol. 43, No. 3 Cross Ref The Tutte Polynomial Part I: General Theory Cross Ref The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded regionEuropean Journal of Combinatorics, Vol. 30, No. 8 Cross Ref Distributed Decomposition Over Hyperspherical Domains24 July 2009 Cross Ref Positive partial transpose from spectra28 November 2007 | Physical Review A, Vol. 76, No. 5 Cross Ref Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented MatroidsElectronic Notes in Discrete Mathematics, Vol. 29 Cross Ref Activity preserving bijections between spanning trees and orientations in graphsDiscrete Mathematics, Vol. 298, No. 1-3 Cross Ref On the Graph-Density of Random 0/1-Polytopes Cross Ref A two-layer paradigm capable of forming arbitrary decision regions in input spaceIEEE Transactions on Neural Networks, Vol. 13, No. 1 Cross Ref Enumeration of linear threshold functions from the lattice of hyperplane intersectionsIEEE Transactions on Neural Networks, Vol. 11, No. 4 Cross Ref Neural networks as systems for recognizing patternsJournal of Mathematical Sciences, Vol. 89, No. 4 Cross Ref Capacity of multilevel threshold devicesIEEE Transactions on Information Theory, Vol. 44, No. 1 Cross Ref Helly, Radon, and Carathéodory Type Theorems Cross Ref Geometrical interpretation of the back-propagation algorithm for the perceptronPhysica A: Statistical Mechanics and its Applications, Vol. 185, No. 1-4 Cross Ref Properties of feedforward neural networks1 January 1999 | Journal of Physics A: Mathematical and General, Vol. 25, No. 7 Cross Ref Partitioning capabilities of two-layer neural networksIEEE Transactions on Signal Processing, Vol. 39, No. 6 Cross Ref On linear separability of random subsets of hypercube vertices1 January 1999 | Journal of Physics A: Mathematical and General, Vol. 24, No. 4 Cross Ref Bounds on the number of hidden neurons in multilayer perceptronsIEEE Transactions on Neural Networks, Vol. 2, No. 1 Cross Ref Algorithms for high dimensional stabbing problemsDiscrete Applied Mathematics, Vol. 27, No. 1-2 Cross Ref Upper bounds on geometric permutations for convex sets1 January 1990 | Discrete & Computational Geometry, Vol. 5, No. 1 Cross Ref Formation of disconnected decision regions with a single hidden layer Cross Ref Algorithms for High Dimensional Stabbing Problems Cross Ref Random polytopes in thed-dimensional cube1 December 1986 | Discrete & Computational Geometry, Vol. 1, No. 4 Cross Ref The expected number of extreme points of a random linear programMathematical Programming, Vol. 35, No. 2 Cross Ref The Tutte decomposition Cross Ref The number of dichotomies and the separating capacity of a set of parallel hyperplanes-The information processing capability of the multithreshold threshold elementsElectronics and Communications in Japan (Part I: Communications), Vol. 66, No. 5 Cross Ref PARTITION OF SYSTEMS' BEHAVIORSKybernetes, Vol. 12, No. 1 Cross Ref The Geometry of Root Systems and Signed Graphs11 April 2018 | The American Mathematical Monthly, Vol. 88, No. 2 Cross Ref A combinatorial analysis of topological dissectionsAdvances in Mathematics, Vol. 25, No. 3 Cross Ref Combinatorial Properties of Associated Zonotopes20 November 2018 | Canadian Journal of Mathematics, Vol. 26, No. 02 Cross Ref Polygons in Arrangements Generated by n Points14 February 2018 | Mathematics Magazine, Vol. 46, No. 3 Cross Ref Threshold Logic AsymptotesIEEE Transactions on Computers, Vol. C-19, No. 4 Cross Ref Comments Cross Ref Les arrangements d'hyperplans: Un chapitre de géométrie combinatoire Cross Ref Bounds on number of hidden neurons of multilayer perceptrons in classification and recognition Cross Ref The number of partitions of a set of N points in k dimensions induced by hyperplanes20 January 2009 | Proceedings of the Edinburgh Mathematical Society, Vol. 15, No. 4 Cross Ref Volume 14, Issue 4| 1966SIAM Journal on Applied Mathematics History Submitted:16 March 1964Accepted:27 October 1965Published online:03 August 2006 InformationCopyright © 1966 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0114068Article page range:pp. 811-818ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics