394 search results - page 27 / 79 » Computing Minimal Polynomials of Matrices |
116
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
133
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
105
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
116
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
149
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
The wide availability of GPS sensors is changing the landscape in the applications of structure from motion techniques for localization. In this paper, we study the problem of est...