Pages that link to "Item:Q5966682"
From MaRDI portal
The following pages link to A RANDOMIZED ALGORITHM FOR SLOPE SELECTION (Q5966682):
Displaying 23 items.
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Randomized optimal algorithm for slope selection (Q1182097) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Incomplete generalized \(L\)-statistics (Q1354475) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Characterizing proximity trees (Q1920422) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Computing balanced convex partitions of lines (Q6174825) (← links)
