132 search results - page 8 / 27 » Sparse Boolean Matrix Factorizations |
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
111
click to vote
ICONIP
2007
14 years 11 months ago
2007
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...