Sciweavers

688 search results - page 7 / 138
» Computing with subspaces
Sort
View
HPCN
1994
Springer
13 years 11 months ago
Communication Cost Reduction for Krylov Methods on Parallel Computers
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...
Eric de Sturler, Henk A. van der Vorst
ICPR
2010
IEEE
13 years 10 months ago
Cluster-Pairwise Discriminant Analysis
Pattern recognition problems often suffer from the larger intra-class variation due to situation variations such as pose, walking speed, and clothing variations in gait recognition...
Yasushi Makihara, Yasushi Yagi
TSP
2008
98views more  TSP 2008»
13 years 7 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
ICCS
2005
Springer
14 years 27 days ago
Bifurcation Analysis of Large Equilibrium Systems in Matlab
The Continuation of Invariant Subspaces (CIS) algorithm produces a smoothly varying basis for an invariant subspace R(s) of a parameter-dependent matrix A(s). In the case when A(s)...
David Bindel, James Demmel, Mark J. Friedman, Will...
DAGM
2001
Springer
13 years 12 months ago
Wavelet Subspace Method for Real-Time Face Tracking
In this article, we present a new method for visual face tracking that is carried out in a wavelet subspace. Initially, a wavelet representation for the face template is created, ...
Volker Krüger, Rogério Schmidt Feris