42 search results - page 7 / 9 » Computing Characteristic Polynomials from Eigenvalues |
COMPUTING
2007
13 years 7 months ago
2007
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
IACR
2011
12 years 7 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we introduce a novel discriminative feature space which is efficient not only for face detection but also for recognition. The face representation is based on local...
TSP
2010
13 years 2 months ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...