Dan Chen

According to our database, Dan Chen authored at least 9 papers between 2008 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Reprint of: Approximating majority depth.

Dan Chen, Pat Morin

Comput. Geom., 2015

2013

Absolute approximation of Tukey depth: Theory and experiments.

Dan Chen, Pat Morin, Uli Wagner

Comput. Geom., 2013

Approximating majority depth.

Dan Chen, Pat Morin

Comput. Geom., 2013

Oja centers and centers of gravity.

Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin

Comput. Geom., 2013

2012

Memoryless routing in convex subdivisions: Random walks are optimal.

Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin

Comput. Geom., 2012

2011

Algorithms for Bivariate Majority Depth.

Dan Chen, Pat Morin

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Oja medians and centers of gravity.

Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

A Branch and Cut Algorithm for the Halfspace Depth Problem

David Bremner, Dan Chen

CoRR, 2009

2008

Output-sensitive algorithms for Tukey depth and related problems.

David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin

Stat. Comput., 2008