The following pages link to (Q3768247):
Displaying 37 items.
- Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
- Convex piecewise-linear fitting (Q374609) (← links)
- An algorithm for continuous piecewise linear bounding of discrete time series data (Q486719) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- On the number of segments needed in a piecewise linear approximation (Q964964) (← links)
- Piecewise-approximation methods for multidimensional curves (Q1073283) (← links)
- Best piecewise constant approximation of a function of single variable (Q1111948) (← links)
- A linear-time algorithm for linear \(L_ 1\) approximation of points (Q1115605) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- Approximation complexity for piecewise monotone functions and real data (Q1323607) (← links)
- Models and algorithms for optimal piecewise-linear function approximation (Q1666822) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case (Q1770724) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Piecewise linear approximation by the method of worst segment division (Q2062105) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345) (← links)
- Examples of the best piecewise linear approximation with free nodes (Q2289416) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
- Optimal piecewise-linear approximation algorithms for complex dependencies (Q2487546) (← links)
- Linear time algorithm for approximating a curve by a single-peaked curve (Q2492629) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- Piecewise linear L<sub>1</sub>approximation of planar curves† (Q3719703) (← links)
- (Q3819483) (← links)
- (Q3975041) (← links)
- Piecewise linear secant approximation via algorithmic piecewise differentiation (Q4685600) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- Streaming algorithms for line simplification (Q5919922) (← links)
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming (Q6103471) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
