148 search results - page 3 / 30 » The random Tukey depth |
CIE
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
COLT
2003
Springer
14 years 22 days ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
SIAMCOMP
1998
13 years 7 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 6 months ago
2010
ASSETS
2004
ACM
14 years 29 days ago
2004
ACM
Using Internet Archive’s Wayback Machine, a random sample of websites from 1997-2002 were retrospectively analyzed for effects that technology has on accessibility for persons w...