158 search results - page 3 / 32 » Depth as Randomness Deficiency |
SODA
2004
ACM
13 years 6 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...
SIAMCOMP
1998
13 years 5 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
ECCC
2010
13 years 3 months ago
2010
ACL
1998
13 years 6 months ago
1998
Current models of story comprehension have three major deficiencies: (1) lack of experimental support for the inference processes they involve (e.g. reliance on prediction); (2) i...
SADM
2011
13 years 8 days 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...