Back to Results
First PageMeta Content
Probabilistic complexity theory / Randomized algorithm / Outlier / Algorithm / RANSAC / CURE data clustering algorithm / Statistics / Robust statistics / Analysis of algorithms


CCCG 2013, Waterloo, Ontario, August 8–10, 2013 How to Cover Most of a Point Set with a V-Shape of Minimum Width Boris Aronov∗
Add to Reading List

Document Date: 2013-08-11 21:51:58

Open Document

File Size: 241,59 KB

Share Result on Facebook
UPDATE