Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Algorithms and complexity for least median of squares regression
Discrete Applied Mathematics
Robust regression and outlier detection
Robust regression and outlier detection
Sorting in c log n parallel steps
Combinatorica
An optimal-time algorithm for slope selection
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Fitting a Second Degree Curve in the Presence of Error
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computing the update of the repeated median regression line in linear time
Information Processing Letters
Repeated median and hybrid filters
Computational Statistics & Data Analysis
| Hi-index | 0.00 |
The repeated median regression line is a robust regression estimate, having a maximal 50% breakdown point. This paper presents an O(n(log n)2) algorithm for finding the repeated median regression line through n points in the plane.