Sciweavers

155 search results - page 17 / 31
» Fast matrix rank algorithms and applications
Sort
View
ICIP
2009
IEEE
14 years 7 months ago
Fast subspace-based tensor data filtering
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
Julien Marot, Caroline Fossati, Salah Bourennane
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
ICASSP
2011
IEEE
14 years 1 months 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
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 8 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...
ICCV
2007
IEEE
15 years 11 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan