Pages that link to "Item:Q3281401"
From MaRDI portal
The following pages link to On the approximation of curves by line segments using dynamic programming (Q3281401):
Displaying 42 items.
- Nonparametric multiple change-point estimation for analyzing large Hi-C data matrices (Q111617) (← links)
- Time series modeling by a regression approach based on a latent process (Q141404) (← links)
- Change-point model on nonhomogeneous Poisson processes with application in copy number profiling by next-generation DNA sequencing (Q439133) (← links)
- An algorithm for continuous piecewise linear bounding of discrete time series data (Q486719) (← links)
- Discovering bands from graphs (Q736508) (← links)
- A proportional hazards regression model with change-points in the baseline function (Q746409) (← links)
- Embedding HMMs-based models in a Euclidean space: the topological hidden Markov models (Q969112) (← links)
- An algorithm for segment approximation (Q1060802) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- Best piecewise constant approximation of a function of single variable (Q1111948) (← links)
- Optimal approximation of convex curves by functions which are piecewise linear (Q1222010) (← links)
- Change-point estimation in the multivariate model taking into account the dependence: application to the vegetative development of oilseed rape (Q1618099) (← links)
- Strongly polynomial efficient approximation scheme for segmentation (Q1628675) (← links)
- Consistent change-point detection with kernels (Q1711585) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- New efficient algorithms for multiple change-point detection with reproducing kernels (Q1796951) (← links)
- Uniform piecewise polynomial approximation with variable joints (Q1846189) (← links)
- Greedy Gaussian segmentation of multivariate time series (Q2324258) (← links)
- Automatic segmentation of metaphase cells based on global context and variant analysis (Q2384943) (← links)
- Approximation and allocation (Q2394436) (← links)
- On the approximation of trajectories and its applications to control systems optimization problems (Q2394451) (← links)
- Multiple straight-line fitting using a Bayes factor (Q2418301) (← links)
- Fast sequence segmentation using log-linear models (Q2435697) (← links)
- A statistical significance testing approach to mining the most informative set of patterns (Q2435712) (← links)
- A dynamic programming segmentation procedure for hydrological and environmental time series (Q2505921) (← links)
- Segmental differential approximation and the 'black box' problem (Q2522555) (← links)
- Piecewise regression mixture for simultaneous functional data clustering and optimal segmentation (Q2628065) (← links)
- The network-untangling problem: from interactions to activity timelines (Q2659278) (← links)
- Minimum-error classes for matching parts (Q2661599) (← links)
- Piece wise linear least–squares approximation of planar curves (Q3200454) (← links)
- Uniform partition and the best least-squares piecewise polynomial approximation (Q3209588) (← links)
- The DFS Fused Lasso: Linear-Time Denoising over General Graphs (Q4558501) (← links)
- Initializing the EM Algorithm for Univariate Gaussian, Multi-Component, Heteroscedastic Mixture Models by Dynamic Programming Partitions (Q4563129) (← links)
- Piecewise linear Chebyshev approximation of planar curves (Q4743655) (← links)
- Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set (Q5084430) (← links)
- Estimating the Number of Block Boundaries from Diagonal Blockwise Matrices Without Penalization (Q5738841) (← links)
- Approximative Policy Iteration for Exit Time Feedback Control Problems Driven by Stochastic Differential Equations using Tensor Train Format (Q5865245) (← links)
- An efficient evolutionary algorithm for accurate polygonal approximation (Q5953123) (← links)
- An average-compress algorithm for the sample mean problem under dynamic time warping (Q6164020) (← links)
- Fast and fully-automated histograms for large-scale data sets (Q6167056) (← links)
- Optimal change-point detection and localization (Q6183751) (← links)
- Column-coherent matrix decomposition (Q6535177) (← links)
