메뉴 건너뛰기




Volumn 3044, Issue , 2004, Pages 988-997

A Continuous Technique for the Weighted Low-Rank Approximation Problem

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 35048840190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24709-8_104     Document Type: Article
Times cited : (12)

References (14)
  • 2
    • 0001043629 scopus 로고    scopus 로고
    • Runge-Kutta Type Methods Based on Geodesies for Systems of ODEs on the Stiefel Manifold
    • Del Buono, N., Lopez, L.: Runge-Kutta Type Methods Based on Geodesies for Systems of ODEs on the Stiefel Manifold. BIT 41 (5) (2001) 912-923
    • (2001) BIT , vol.41 , Issue.5 , pp. 912-923
    • Del Buono, N.1    Lopez, L.2
  • 3
    • 0032216898 scopus 로고    scopus 로고
    • The Geometry of Algorithms with Orthogonality Constraints
    • Edelman, A., Arias, T.A., Smith, S.T.: The Geometry of Algorithms with Orthogonality Constraints. SIAM J. Matr. Anal. Appl. 20 (1998) 303-353
    • (1998) SIAM J. Matr. Anal. Appl. , vol.20 , pp. 303-353
    • Edelman, A.1    Arias, T.A.2    Smith, S.T.3
  • 4
    • 0019009028 scopus 로고
    • The singular value decomposition: Its computation and some applications
    • Klema, V.C., Laub, A.J.: The singular value decomposition: its computation and some applications. IEEE Trans. Automat. Contr, 25 (1980) 164-176
    • (1980) IEEE Trans. Automat. Contr , vol.25 , pp. 164-176
    • Klema, V.C.1    Laub, A.J.2
  • 5
    • 0029456802 scopus 로고
    • Is the SVD-Based Low-Rank Approximation Optimal?
    • Rio, Brazil
    • Lu, W.S.: Is the SVD-Based Low-Rank Approximation Optimal? Proc. 38th Midwest Symp. CAS, Rio, Brazil, (1995) 470-473
    • (1995) Proc. 38th Midwest Symp. CAS , pp. 470-473
    • Lu, W.S.1
  • 6
    • 0031186856 scopus 로고    scopus 로고
    • Weighted Low-Rank Approximation of General Complex Matrices and its Application in the Design of 2-D Digital Filters
    • Lu, W.S., Pei, S.C., Wang, P.H.: Weighted Low-Rank Approximation of General Complex Matrices and its Application in the Design of 2-D Digital Filters. IEEE Trans. Circuits Syst. I 44 (7) (1997) 650-655
    • (1997) IEEE Trans. Circuits Syst. i , vol.44 , Issue.7 , pp. 650-655
    • Lu, W.S.1    Pei, S.C.2    Wang, P.H.3
  • 7
    • 0032027626 scopus 로고    scopus 로고
    • On Optimal Low-Rank Approximation of Multidimensional Discrete Signals
    • Lu, W.S., Pei, S.G.: On Optimal Low-Rank Approximation of Multidimensional Discrete Signals. IEEE Trans. Circuits Syst. II 45 (3) (1998) 417-422
    • (1998) IEEE Trans. Circuits Syst. II , vol.45 , Issue.3 , pp. 417-422
    • Lu, W.S.1    Pei, S.G.2
  • 8
    • 0038082261 scopus 로고    scopus 로고
    • New Method for Weighted Low-Rank Approximation of Complex-Valued Matrices and its Application for the Design of 2-D Digital Filters
    • Lu, W.S., Antoniou, A.: New Method for Weighted Low-Rank Approximation of Complex-Valued Matrices and its Application for the Design of 2-D Digital Filters. ISCAS Vol. Ill (2003) 694-697
    • (2003) ISCAS , vol.3 , pp. 694-697
    • Lu, W.S.1    Antoniou, A.2
  • 10
    • 1942418128 scopus 로고
    • A weighted-least-squares matrix decomposition method with applications to the design of two-dimensional digital filters
    • Shpak, D.: A weighted-least-squares matrix decomposition method with applications to the design of two-dimensional digital filters. IEEE Thirty Third Midwest Symposium on Circuits and Systems (1990).
    • (1990) IEEE Thirty Third Midwest Symposium on Circuits and Systems
    • Shpak, D.1
  • 11
    • 35948980047 scopus 로고    scopus 로고
    • Generalized Low-Rank Approximations
    • MIT Artificial Intelligence Laboratory
    • Srebro, N., Jaakkola, T.: Generalized Low-Rank Approximations. AI Memo 2003001, MIT Artificial Intelligence Laboratory (2003).
    • (2003) AI Memo 2003001
    • Srebro, N.1    Jaakkola, T.2
  • 13
    • 0034202338 scopus 로고    scopus 로고
    • Separating style and content with bilinear models
    • Tenenbaum, J.B., Freeman, W.T.: Separating style and content with bilinear models. Neural Computation 12 (2000) 1247-1283.
    • (2000) Neural Computation , vol.12 , pp. 1247-1283
    • Tenenbaum, J.B.1    Freeman, W.T.2
  • 14
    • 0005478041 scopus 로고
    • Maximum likelihood estimation and factor anlysis
    • Young, G.: Maximum likelihood estimation and factor anlysis. Psychometrika 6 (1940) 49-53.
    • (1940) Psychometrika , vol.6 , pp. 49-53
    • Young, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.