165 search results - page 20 / 33 » Computing a Nearest Correlation Matrix with Factor Structure |
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
ITICSE
2010
ACM
13 years 11 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
ICDM
2006
IEEE
14 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
We describe a generative model of the relationship between two images. The model is defined as a factored threeway Boltzmann machine, in which hidden variables collaborate to de...