<--- Back to Details
First PageDocument Content
Numerical linear algebra / Matrix theory / Matrices / Cholesky decomposition / Incomplete Cholesky factorization / Adjacency matrix / Singular value decomposition / Orthogonal matrix / Matrix / Algebra / Linear algebra / Mathematics
Date: 2014-11-12 16:58:00
Numerical linear algebra
Matrix theory
Matrices
Cholesky decomposition
Incomplete Cholesky factorization
Adjacency matrix
Singular value decomposition
Orthogonal matrix
Matrix
Algebra
Linear algebra
Mathematics

Scaling Manifold Ranking Based Image Retrieval Yasuhiro Fujiwara† , Go Irie‡ , Shari Kuroyama∗ , Makoto Onizuka§† †NTT Software Innovation Center, [removed]Midori-cho Musashino-shi, Tokyo, Japan ‡NTT Service E

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 1,26 MB

Share Document on Facebook

Similar Documents

Matrix Valued Orthogonal Polynomials for Gelfand Pairs of Rank One Gert Heckman and Maarten van Pruijssen Radboud University Nijmegen October 18, 2013 Abstract

Matrix Valued Orthogonal Polynomials for Gelfand Pairs of Rank One Gert Heckman and Maarten van Pruijssen Radboud University Nijmegen October 18, 2013 Abstract

DocID: 1tQah - View Document

THE BETA-JACOBI MATRIX MODEL, THE CS DECOMPOSITION, AND GENERALIZED SINGULAR VALUE PROBLEMS ALAN EDELMAN AND BRIAN D. SUTTON  Abstract. We provide a solution to the β-Jacobi matrix model problem

THE BETA-JACOBI MATRIX MODEL, THE CS DECOMPOSITION, AND GENERALIZED SINGULAR VALUE PROBLEMS ALAN EDELMAN AND BRIAN D. SUTTON Abstract. We provide a solution to the β-Jacobi matrix model problem

DocID: 1r1Io - View Document

Computing the Complete CS Decomposition Brian D. Sutton∗ May 20, 2008 Abstract An algorithm for computing the complete CS decomposition of a partitioned unitary matrix is developed. Although the existence of the CS dec

Computing the Complete CS Decomposition Brian D. Sutton∗ May 20, 2008 Abstract An algorithm for computing the complete CS decomposition of a partitioned unitary matrix is developed. Although the existence of the CS dec

DocID: 1qWf4 - View Document

CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant∗ April 20,

CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant∗ April 20,

DocID: 1qRJK - View Document

SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997  BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP

SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997 BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP

DocID: 1qHdb - View Document