Pages that link to "Item:Q5687649"
From MaRDI portal
The following pages link to AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS (Q5687649):
Displaying 15 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Data imprecision under \(\lambda\)-geometry model (Q527138) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
