Sciweavers

688 search results - page 36 / 138
» Computing with subspaces
Sort
View
ICML
2007
IEEE
15 years 10 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
111
Voted
SIAMMAX
2011
157views more  SIAMMAX 2011»
14 years 14 days ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
CVPR
2008
IEEE
15 years 11 months ago
Visual tracking via incremental Log-Euclidean Riemannian subspace learning
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
14 years 11 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
CGF
2008
131views more  CGF 2008»
14 years 9 months ago
Concurrent Viewing of Multiple Attribute-Specific Subspaces
In this work we present a point classification algorithm for multi-variate data. Our method is based on the concept of attribute subspaces, which are derived from a set of user sp...
Robert Sisneros, C. Ryan Johnson, Jian Huang