76 search results - page 12 / 16 » Fast approximation of convex hull |
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
ECML
2007
Springer
14 years 4 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
IMR
2004
Springer
14 years 3 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...