394 search results - page 16 / 79 » Computing Minimal Polynomials of Matrices |
105
Voted
DAM
2008
15 years 16 days ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
99
Voted
ECCC
1998
15 years 4 days ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
102
click to vote
ECCV
1998
Springer
16 years 2 months ago
1998
Springer
This paper gives a practical and accurate algorithm for the computation of the quadrifocal tensor and extraction of camera matrices from it. Previous methods for using the quadrifo...
116
Voted
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
102
Voted
STOC
1997
ACM
15 years 4 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...