Pages that link to "Item:Q5629250"
From MaRDI portal
The following pages link to Some Upper Bounds on Error Probability for Multiclass Pattern Recognition (Q5629250):
Displaying 5 items.
- A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Some properties of Matusita's measure of affinity of several distributions (Q1243972) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- Onion polygonizations (Q1351597) (← links)