Pages that link to "Item:Q1591950"

The following pages link to An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950):

Displayed 4 items.

• Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) ‎ (← links)
• Kernel projection algorithm for large-scale SVM problems. (Q1850682) ‎ (← links)
• Hausdorff matching and Lipschitz optimization (Q2457916) ‎ (← links)
• A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty (Q2462584) ‎ (← links)