Pages that link to "Item:Q1319352"

The following pages link to Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons (Q1319352):

Displaying 7 items.

• The construction of minimal multilayered perceptrons: A case study for sorting (Q689481) (← links)
• On the capabilities of multilayer perceptrons (Q1105387) (← links)
• On the realization of discriminant functions by means of multilayer perceptrons (Q1277830) (← links)
• The minimal number of layers of perceptron that sorts (Q1325994) (← links)
• Binary classifiers, perceptrons and connectedness in metric spaces and graphs (Q1326766) (← links)
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ (Q3421386) (← links)
• A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment (Q3440259) (← links)