Hyperplane arrangements separating arbitrary vertex classes in \(n\)-cubes

DOI10.1006/aama.2000.0701zbMath0984.52010OpenAlexW1970099570MaRDI QIDQ5927944

Frank Pasemann, Walter Wenzel, Nihat Ay

Publication date: 25 March 2001

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.2000.0701

zbMATH Keywords

hypercubeaffine oriented hyperplane arrangementsbinary unitsfeedforward networks with binary neuronslinear codesseparability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Applications of design theory to circuits and networks (94C30)

Related Items (2)

Covering and packing problems in lattices associated with the \(n\)-cube ⋮ When Does a Mixture of Products Contain a Product of Mixtures?

Cites Work

• Multilayer feedforward networks are universal approximators
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Approximation by superpositions of a sigmoidal function
• Unnamed Item

This page was built for publication: Hyperplane arrangements separating arbitrary vertex classes in \(n\)-cubes