Topics
algorithmMusic genre
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 presented
A notion of multivariate depth, resp. quantile region, was introduced in [Chernozhukov et al., 2017]...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...
A randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G. Koshev...
AbstractA randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G...
Zonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. Koshevoy...
AbstractZonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. ...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
Under some mild conditions on probability distribution P, if lim(n) P-n = P weakly then the sequence...
The concept of location depth was introduced as a way to extend the univariate notion of ranking to ...
The thesis unifies the most important author's results in the field of algorithms concerning zonotop...
Abstract. In the paper we consider a generalized version of three well-known problems: Selection Pro...
. A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean ...
The concept of location depth was introduced as a way to extend the univariate notion of ranking to ...
Classical multivariate statistics measures the outlyingness of a point by its Mahalanobis distance f...
A notion of multivariate depth, resp. quantile region, was introduced in [Chernozhukov et al., 2017]...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...
A randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G. Koshev...
AbstractA randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G...
Zonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. Koshevoy...
AbstractZonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. ...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
Under some mild conditions on probability distribution P, if lim(n) P-n = P weakly then the sequence...
The concept of location depth was introduced as a way to extend the univariate notion of ranking to ...
The thesis unifies the most important author's results in the field of algorithms concerning zonotop...
Abstract. In the paper we consider a generalized version of three well-known problems: Selection Pro...
. A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean ...
The concept of location depth was introduced as a way to extend the univariate notion of ranking to ...
Classical multivariate statistics measures the outlyingness of a point by its Mahalanobis distance f...
A notion of multivariate depth, resp. quantile region, was introduced in [Chernozhukov et al., 2017]...
A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two v...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...
Add to ORKG