An on-line algorithm for fitting straight lines between data ranges
From MaRDI portal
Publication:3916032
Cited in
(25)- Finding transversals for sets of simple geometric figures
- An approach for the estimation of the precision of a real object from its digitization
- On the performance of learned data structures
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
- Approximating points by a piecewise linear function
- Improved points approximation algorithms based on simplicial thickness data structures
- Unsupervised polygonal reconstruction of noisy contours by a discrete irregular approach
- An Approach for the Estimation of the Precision of a Real Object from its Digitization
- Linear approximation of simple objects
- Outlier respecting points approximation
- Some discrete properties of the space of line transversals to disjoint balls
- Average curve of \(n\) digital curves
- Fitting a step function to a point set with outliers based on simplicial thickness data structures
- Stabbers of line segments in the plane
- Linear approximation of simple objects
- Linear approximation of simple objects
- Representing a functional curve by curves with fewer peaks
- PLA-index: a k-mer index exploiting rank curve linearity
- LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization
- FL-RMQ: a learned approach to range minimum queries
- Efficiency of learned indexes on genome spectra
- A dynamic piecewise-linear geometric index with worst-case guarantees
- Compressibility measures and succinct data structures for piecewise linear approximations
- Computing shortest transversals
This page was built for publication: An on-line algorithm for fitting straight lines between data ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916032)
