1993
DOI: 10.1016/0167-9473(93)90135-g
|View full text |Cite
|
Sign up to set email alerts
|

Parallel algorithms for least median of squares regression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1994
1994
2002
2002

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Kaufman et al noted that inter-processor communication is often a critical factor and some form of load balancing is often necessary. Xu and Shiue (1993) developed three SPMD-type parallel algorithms for least median of squares (LMS) regression (Rousseeuw, 1984), using an Intel iPSC/2 MIMD computer. Parallelization strategies were deduced from consideration of the nested loop structure of sequential implementations.…”
Section: Linear Regressionmentioning
confidence: 99%
“…Kaufman et al noted that inter-processor communication is often a critical factor and some form of load balancing is often necessary. Xu and Shiue (1993) developed three SPMD-type parallel algorithms for least median of squares (LMS) regression (Rousseeuw, 1984), using an Intel iPSC/2 MIMD computer. Parallelization strategies were deduced from consideration of the nested loop structure of sequential implementations.…”
Section: Linear Regressionmentioning
confidence: 99%
“…Several algorithms have been proposed in order to construct an exact LMS regression line in an efficient way; see, e.g., Steele and Steiger (1986), Souvaine and Steele (1987), Edelsbrunner and Souvaine (1990) and, Xu and Shiue (1993).…”
Section: Determination Of Minquantile Linesmentioning
confidence: 99%