999 search results - page 10 / 200 » Spectral simplex method |
SIAMJO
2000
14 years 9 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
SIAMSC
2008
14 years 9 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
101
click to vote
ACL
2012
13 years 5 hour ago
2012
We introduce a spectral learning algorithm for latent-variable PCFGs (Petrov et al., 2006). Under a separability (singular value) condition, we prove that the method provides cons...
BMVC
2002
15 years 3 hour ago
2002
This paper describes a hierarchical spectral method for the correspondence matching of point-sets. Conventional spectral methods for correspondence matching are notoriously suscep...
123
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...