155 search results - page 11 / 31 » Fast matrix rank algorithms and applications |
WWW
2005
ACM
15 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
the following cost functions: In this paper, learning rules are proposed for simultaneous corn- GI(U) = tr{(UTU)(UTBU)-lD, (la) putation of minor eigenvectors of a covariance matri...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instant...
162
click to vote
SIAMJO
2011
14 years 4 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
98
Voted
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...