Sciweavers

588 search results - page 10 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
TSP
2008
98views more  TSP 2008»
14 years 11 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
15 years 8 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
SIAMMAX
2010
97views more  SIAMMAX 2010»
14 years 6 months ago
Krylov Subspace Methods for Linear Systems with Tensor Product Structure
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
Daniel Kressner, Christine Tobler
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 11 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
CVPR
2006
IEEE
16 years 1 months ago
When Fisher meets Fukunaga-Koontz: A New Look at Linear Discriminants
The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criteri...
Sheng Zhang, Terence Sim