2239 search results - page 64 / 448 » Computing with abstract matrix structures |
123
click to vote
CVPR
2005
IEEE
15 years 1 months ago
2005
IEEE
Multibody affine Structure From Motion (SFM) methods commonly assume independent motion between objects such that the ‘measurement matrix’ has rank 4k. When multiple views ar...
111
click to vote
JMLR
2010
14 years 6 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
118
click to vote
ICCV
2011
IEEE
13 years 12 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...
DIS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
105
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...