Pages that link to "Item:Q2375945"
From MaRDI portal
The following pages link to Approximating points by a piecewise linear function (Q2375945):
Displaying 7 items.
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- On the performance of learned data structures (Q2031054) (← links)
- Weighted \(L_{\infty}\) isotonic regression (Q2409576) (← links)
- Fluctuated Fitting Under the $$\ell _1$$ -metric (Q4632208) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
