On the approximation of curves by line segments using dynamic programming

Cited in

(50)

An algorithm for segment approximation
Richard Bellman's contributions to computer science
Best piecewise constant approximation of a function of single variable
Nonparametric multiple change-point estimation for analyzing large Hi-C data matrices
Optimal approximation of convex curves by functions which are piecewise linear
Time series modeling by a regression approach based on a latent process
Change-point estimation in the multivariate model taking into account the dependence: application to the vegetative development of oilseed rape
Strongly polynomial efficient approximation scheme for segmentation
Consistent change-point detection with kernels
Discovering recurring activity in temporal networks
New efficient algorithms for multiple change-point detection with reproducing kernels
Uniform piecewise polynomial approximation with variable joints
Greedy Gaussian segmentation of multivariate time series
Automatic segmentation of metaphase cells based on global context and variant analysis
Approximation and allocation
On the approximation of trajectories and its applications to control systems optimization problems
Multiple straight-line fitting using a Bayes factor
Fast sequence segmentation using log-linear models
A statistical significance testing approach to mining the most informative set of patterns
A dynamic programming segmentation procedure for hydrological and environmental time series
Segmental differential approximation and the 'black box' problem
Piecewise regression mixture for simultaneous functional data clustering and optimal segmentation
The network-untangling problem: from interactions to activity timelines
Minimum-error classes for matching parts
Piece wise linear least–squares approximation of planar curves
Uniform partition and the best least-squares piecewise polynomial approximation
Change-point model on nonhomogeneous Poisson processes with application in copy number profiling by next-generation DNA sequencing
The DFS fused Lasso: linear-time denoising over general graphs
Initializing the EM algorithm for univariate Gaussian, multi-component, heteroscedastic mixture models by dynamic programming partitions
Piecewise linear Chebyshev approximation of planar curves
An algorithm for continuous piecewise linear bounding of discrete time series data
Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
Estimating the number of block boundaries from diagonal blockwise matrices without penalization
Approximative policy iteration for exit time feedback control problems driven by stochastic differential equations using tensor train format
An efficient evolutionary algorithm for accurate polygonal approximation
An average-compress algorithm for the sample mean problem under dynamic time warping
Fast and fully-automated histograms for large-scale data sets
Optimal change-point detection and localization
Column-coherent matrix decomposition
New convex integral inequalities involving multiple functions
New and original integral inequalities under monotonicity and convexity assumptions
Efficient XAI: a low-cost data reduction approach to SHAP interpretability
Ms.FPOP: A Fast Exact Segmentation Algorithm with a Multiscale Penalty
A discrete unified gas kinetic scheme with sparse velocity grid for rarefied gas flows
On new Fejér type integral inequalities via a change of variables approach
Quantum speedups for polynomial-time dynamic programming algorithms
Contrasting global and patient-specific regression models via a neural network representation
Discovering bands from graphs
A proportional hazards regression model with change-points in the baseline function
Embedding HMMs-based models in a Euclidean space: the topological hidden Markov models

This page was built for publication: On the approximation of curves by line segments using dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3281401)