Pages that link to "Item:Q1608898"
From MaRDI portal
The following pages link to Lower bounds for computing statistical depth. (Q1608898):
Displaying 15 items.
- Point set stratification and Delaunay depth (Q1019881) (← links)
- A lower bound for computing Oja depth (Q1044726) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- On Liu's simplicial depth and Randles' interdirections (Q1659197) (← links)
- Penalty-based aggregation of multidimensional data (Q1697611) (← links)
- General notions of statistical depth function. (Q1848784) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
- K-sign depth: from asymptotics to efficient implementation (Q2242867) (← links)
- On Combinatorial Depth Measures (Q4631012) (← links)
- Extending the centerpoint theorem to multiple points (Q5091045) (← links)
- FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES (Q5299999) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
