895 search results - page 115 / 179 » Approximate convex decomposition |
SIAMCOMP
1998
14 years 9 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
168
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
ICML
2005
IEEE
15 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...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...