Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

SOFSEM
2000
Springer

favoriteEmaildiscussreport

130views Theoretical Computer Science» more SOFSEM 2000»

Computing the Dimension of Linear Subspaces

14 years 2 months ago

Computing the Dimension of Linear Subspaces

Download cca-net.de

Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau

Martin Ziegler, Vasco Brattka

Real-time Traffic

Linear | Linear Algebra | Linear Subspace | SOFSEM 2000 | Theoretical Computer Science |

claim paper

Related Content

» Spectral clustering of linear subspaces for motion segmentation

» Sirface vs Fisherface recognition using class specific linear projection

» Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm

» A New GPCA Algorithm for Clustering Subspaces by Fitting Differentiating and Dividing Poly...

» A Weighted Nearest Mean Classifier for Sparse Subspaces

» A fast linear separability test by projection of positive points on subspaces

» Adaptive dimension reduction using discriminant analysis and Kmeans clustering

» Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations

» Convergence and Rate of Convergence of a ManifoldBased Dimension Reduction Algorithm

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	SOFSEM
Authors	Martin Ziegler, Vasco Brattka

Comments (0)