Sciweavers

307 search results - page 11 / 62
» The convex hull of ellipsoids
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
COMPGEOM
2011
ACM
12 years 11 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
CCCG
2009
13 years 8 months ago
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
Wenqi Ju, Jun Luo
ML
2007
ACM
113views Machine Learning» more  ML 2007»
13 years 7 months ago
PAV and the ROC convex hull
Classifier calibration is the process of converting classifier scores into reliable probability estimates. Recently, a calibration technique based on isotonic regression has gain...
Tom Fawcett, Alexandru Niculescu-Mizil
JACM
2010
135views more  JACM 2010»
13 years 6 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan