Pages that link to "Item:Q269155"
From MaRDI portal
The following pages link to Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) (Q269155):
Displaying 4 items.
- Solving the classification problem using \(\varepsilon\)-nets (Q333577) (← links)
- An algorithm to construct separable \(\epsilon\)-nets of two sets (Q508581) (← links)
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application (Q1344421) (← links)
- Using $$\epsilon $$ -nets for Solving the Classification Problem (Q5274971) (← links)
