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...
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
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 ...
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...
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...