316 search results - page 7 / 64 » Bounded Depth Data Trees |
SADM
2011
13 years 2 months ago
2011
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...