Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing the Depth of a Flat

Published 25 Sep 2000 in cs.CG | (0009024v1)

Abstract: We give algorithms for computing the regression depth of a k-flat for a set of n points in Rd. The running time is O(nd-2 + n log n) when 0 < k < d-1, faster than the best time bound for hyperplane regression or for data depth.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up