Sciweavers

285 search results - page 11 / 57
» Steaming on Convex Hulls
Sort
View
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 5 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
COMPGEOM
1995
ACM
13 years 11 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
ICCSA
2004
Springer
14 years 24 days ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...