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∗ - RANSAC - Document - PDFSEARCH.IO

First Page	Meta Content
	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 City Waterloo / / Country Denmark / / / Facility University of Aarhus / Polytechnic Institute of NYU / / IndustryTerm above algorithms / constant-factor approximation algorithm / inner-outer algorithm / approximation algorithm / both-inner algorithm / binary search / both-outer algorithm / above algorithm / / Organization eln / University of Aarhus / National Science Foundation / NYU / Polytechnic Institute / US Department of Education / / Person V . Clearly / V / Muriel Dulieu / Mark Yagnatinsky / John Iacono / / Position Prime Minister / / ProvinceOrState Ontario / / Technology above algorithms / constant-factor approximation algorithm / above algorithm / 2 2.1 The algorithm / randomized algorithm / inner-outer algorithm / approximation algorithm / both-outer algorithm / 2 The algorithm / both-inner algorithm / 5 Algorithm / two algorithms / / URL http / SocialTag 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