24 search results - page 1 / 5 » Colourful Simplicial Depth |
DCG
2006
13 years 5 months ago
2006
Inspired by B
DCG
2011
13 years 5 days ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
JCO
2008
13 years 5 months ago
2008
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
MA
2010
Springer
13 years 3 months ago
2010
Springer
Global depth, tangent depth and simplicial depths for classical and orthogonal regression are compared in examles and properies that are usefull for calculations are derived. Algo...
CSDA
2007
13 years 5 months ago
2007
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...