451 search results - page 52 / 91 » Some Lower Bounds on Geometric Separability Problems |
NIPS
2003
14 years 11 months ago
2003
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
TIT
2002
14 years 9 months ago
2002
Abstract--We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob ...
ACCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a lip contour tracking algorithm using attractorguided particle filtering. Usually it is difficult to robustly track the lip contour because the lip contour i...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...