On the approximation of curves by line segments using dynamic programming
From MaRDI portal
Publication:3281401
DOI10.1145/366573.366611zbMath0100.12901OpenAlexW1975946664MaRDI QIDQ3281401
Publication date: 1961
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/366573.366611
Related Items
Change-point estimation in the multivariate model taking into account the dependence: application to the vegetative development of oilseed rape, Richard Bellman's contributions to computer science, Strongly polynomial efficient approximation scheme for segmentation, Piecewise regression mixture for simultaneous functional data clustering and optimal segmentation, 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, Best piecewise constant approximation of a function of single variable, Initializing the EM Algorithm for Univariate Gaussian, Multi-Component, Heteroscedastic Mixture Models by Dynamic Programming Partitions, Piece wise linear least–squares approximation of planar curves, The network-untangling problem: from interactions to activity timelines, Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set, Minimum-error classes for matching parts, Uniform partition and the best least-squares piecewise polynomial approximation, Multiple straight-line fitting using a Bayes factor, 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, Fast sequence segmentation using log-linear models, A statistical significance testing approach to mining the most informative set of patterns, Change-point model on nonhomogeneous Poisson processes with application in copy number profiling by next-generation DNA sequencing, Consistent change-point detection with kernels, An algorithm for continuous piecewise linear bounding of discrete time series data, Discovering recurring activity in temporal networks, The DFS Fused Lasso: Linear-Time Denoising over General Graphs, Estimating the Number of Block Boundaries from Diagonal Blockwise Matrices Without Penalization, Embedding HMMs-based models in a Euclidean space: the topological hidden Markov models, Optimal approximation of convex curves by functions which are piecewise linear, An efficient evolutionary algorithm for accurate polygonal approximation, Nonparametric multiple change-point estimation for analyzing large Hi-C data matrices, A dynamic programming segmentation procedure for hydrological and environmental time series, New efficient algorithms for multiple change-point detection with reproducing kernels, Time series modeling by a regression approach based on a latent process, Discovering bands from graphs, Segmental differential approximation and the 'black box' problem, A proportional hazards regression model with change-points in the baseline function, Greedy Gaussian segmentation of multivariate time series, Piecewise linear Chebyshev approximation of planar curves, Uniform piecewise polynomial approximation with variable joints, An algorithm for segment approximation, Approximative Policy Iteration for Exit Time Feedback Control Problems Driven by Stochastic Differential Equations using Tensor Train Format
