Efficient randomized algorithms for the repeated median line estimator
From MaRDI portal
Publication:1386373
DOI10.1007/PL00009190zbMath0895.68057OpenAlexW3136345023WikidataQ56607632 ScholiaQ56607632MaRDI QIDQ1386373
David M. Mount, Ji{ří} Matoušek, Nathan S. Netanyahu
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009190
Related Items (6)
On minimizing distance by the road less traveled ⋮ Repeated median and hybrid filters ⋮ Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses ⋮ MINKOWSKI SUM SELECTION AND FINDING ⋮ A practical approximation algorithm for the LMS line estimator ⋮ Computing the update of the repeated median regression line in linear time
This page was built for publication: Efficient randomized algorithms for the repeated median line estimator