139 search results - page 2 / 28 » A Singular Value Thresholding Algorithm for Matrix Completio... |
NAACL
2007
13 years 6 months ago
2007
This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. T...
SYRCODIS
2007
13 years 6 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
FOCM
2011
12 years 12 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
ICIP
2003
IEEE
14 years 6 months ago
2003
IEEE
In this paper, we first discuss the singular value decomposition (SVD) of a quaternion matrix and propose an algorithm to calculate the SVD of a quaternion matrix using its equiva...
STACS
2010
Springer
13 years 12 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...