19866 search results - page 150 / 3974 » Computing all factorizations in *** |
157
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
168
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
191
click to vote
ECCV
2000
Springer
15 years 10 months ago
2000
Springer
Factorization using Singular Value Decomposition (SVD) is often used for recovering 3D shape and motion from feature correspondences across multiple views. SVD is powerful at find...
225
click to vote
TKDE
2012
13 years 9 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
200
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...