A lower bound for computing Oja depth
type: Item
instance of: scholarly article
title: A lower bound for computing Oja depth
zbMATH Open document ID: 1184.68552
author: Greg Aloupis
author: Erin McLeish
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5650147
zbMATH Keywords: algorithms
zbMATH Keywords: computational geometry
zbMATH Keywords: computational statistics
zbMATH Keywords: data depth
zbMATH Keywords: bivariate medians
describes a project that uses: AS 307
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.05.014
OpenAlex ID: W2085492198
cites work: Lower bounds for computing statistical depth.
cites work: Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
cites work: Q3830361
cites work: On a notion of data depth based on random simplices
cites work: Descriptive statistics for multivariate distributions
cites work: Algorithm AS 307: Bivariate Location Depth
cites work: Q4117205
DOI: 10.1016/J.IPL.2005.05.014
Recommended article: A proof of the Oja depth conjecture in the plane
Recommended article: Lower bounds for computing statistical depth.
Recommended article: Depth Lower Bounds against Circuits with Sparse Orientation
Recommended article: Depth Lower Bounds against Circuits with Sparse Orientation*
Recommended article: On approximating the depth and related problems
Recommended article: On Approximating the Depth and Related Problems
Recommended article: Computing depth orders and related problems
Recommended article: Lower bounds on the depth of monotone arithmetic computations
Recommended article: Q4230351
description: scientific article; zbMATH DE number 5650147