Pages that link to "Item:Q689144"
From MaRDI portal
The following pages link to A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144):
Displaying 7 items.
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Random sampling with removal (Q2207595) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
