Sciweavers

180 search results - page 7 / 36
» Parallel Algorithms for Singular Value Decomposition
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
14 years 9 months ago
Empirical Evaluation of Four Tensor Decomposition Algorithms
Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is ...
Peter D. Turney
78
Voted
SCL
2010
141views more  SCL 2010»
14 years 8 months ago
On the computation of structured singular values and pseudospectra
Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computation...
Michael Karow, Effrosini Kokiopoulou, Daniel Kress...
102
Voted
ICMCS
2005
IEEE
172views Multimedia» more  ICMCS 2005»
15 years 3 months ago
A Study of Synthesizing New Human Motions from Sampled Motions Using Tensor Decomposition
This paper applies an algorithm, based on Tensor Decomposition, to a new synthesis application: by using sampled motions of people of different ages under different emotional stat...
Rovshan Kalanov, Jieun Cho, Jun Ohya
IPM
2006
132views more  IPM 2006»
14 years 9 months ago
A framework for understanding Latent Semantic Indexing (LSI) performance
In this paper we present a theoretical model for understanding the performance of Latent Semantic Indexing (LSI) search and retrieval applications. Many models for understanding L...
April Kontostathis, William M. Pottenger
80
Voted
RT
1999
Springer
15 years 1 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool