Sciweavers

70 search results - page 11 / 14
» Fast computation of low rank matrix
Sort
View
ICML
2007
IEEE
14 years 9 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
SIAMMAX
2010
97views more  SIAMMAX 2010»
13 years 3 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
CVPR
2012
IEEE
11 years 11 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
ICASSP
2011
IEEE
13 years 8 days ago
Proportionate affine projection sign algorithms for sparse system identification in impulsive interference
Two proportionate af ne projection sign algorithms (APSAs) are proposed for system identi cation applications, such as network echo cancellation (NEC), where the impulse response ...
Zengli Yang, Yahong Rosa Zheng, Steven L. Grant
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 2 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...