Sciweavers

588 search results - page 22 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
ICCSA
2005
Springer
14 years 3 months ago
A Penalized Likelihood Estimation on Transcriptional Module-Based Clustering
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
Ryo Yoshida, Seiya Imoto, Tomoyuki Higuchi
FGR
2006
IEEE
255views Biometrics» more  FGR 2006»
14 years 1 months ago
Incremental Kernel SVD for Face Recognition with Image Sets
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
Tat-Jun Chin, Konrad Schindler, David Suter
TIFS
2008
157views more  TIFS 2008»
13 years 10 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
EUROPAR
2009
Springer
14 years 4 months ago
PSPIKE: A Parallel Hybrid Sparse Linear System Solver
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
Murat Manguoglu, Ahmed H. Sameh, Olaf Schenk
TIT
1998
121views more  TIT 1998»
13 years 9 months ago
Blind Multiuser Detection: A Subspace Approach
—A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimummean-...
Xiaodong Wang, H. Vincent Poor