148 search results - page 2 / 30 » The random Tukey depth |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
"Oneperson's noise is another person's signal." For manyapplications, including the detection of credit card frauds and the monitoringof criminal activities in...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
COMGEO
2008
ACM
13 years 4 months ago
2008
ACM
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...