394 search results - page 30 / 79 » Computing Minimal Polynomials of Matrices |
SIAMSC
2010
14 years 11 months ago
2010
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is...
119
click to vote
TCS
2008
15 years 12 days ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
This paper proposes a new registration algorithm, Covariance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. Th...
105
Voted
STACS
2004
Springer
15 years 5 months ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...