24 search results - page 1 / 5 » Regression Depth and Center Points |
DCG
2000
13 years 5 months ago
2000
DCG
2008
13 years 5 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...