141 search results - page 17 / 29 » Self-improving Algorithms for Convex Hulls |
CA
1996
IEEE
15 years 1 months ago
1996
IEEE
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
107
click to vote
ISVC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
SENSYS
2010
ACM
14 years 7 months ago
2010
ACM
Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant...
CCCG
1993
14 years 10 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...