419 search results - page 18 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
TPDS
2010
13 years 6 months ago
2010
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
ICASSP
2011
IEEE
12 years 11 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...
GPB
2010
13 years 5 months ago
2010
The detection of genes that show similar profiles under different experimental conditions is often an initial step in inferring the biological significance of such genes. Visualiz...
CVPR
2004
IEEE
2004
IEEE
Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study
14 years 9 months ago
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison betwe...