An optimal randomized algorithm for d-variate zonoid depth

13 years 4 months ago

Download www.scs.carleton.ca

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.

Pat Morin

Real-time Traffic

Applied Computing | COMGEO 2008 | Fixed Dimensional Point | Linear Expected-time Algorithm | Zonoid Depth |

claim paper

» A learningbased framework for depth ordering

» Learning Image Structures for Optimizing Disparity Estimation

» A Functional Validation Technique BiasedRandom Simulation Guided by ObservabilityBased Cov...

» Optimal Random Matchings on Trees and Applications

» Increasing depth lateral resolution based on sensor fusion

» A TwoLevel Generative Model for Cloth Representation and Shape from Shading

» A Comparative Study of Energy Minimization Methods for Markov Random Fields

» Optimizing Monitoring Queries over Distributed Data

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	COMGEO
Authors	Pat Morin

Comments (0)

Sciweavers

An optimal randomized algorithm for d-variate zonoid depth

Applied Computing | COMGEO 2008 | Fixed Dimensional Point | Linear Expected-time Algorithm | Zonoid Depth |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers