207 search results - page 4 / 42 » The Polynomial Method for Random Matrices |
ISSAC
2009
Springer
14 years 18 days ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
JC
2000
13 years 5 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
Random projection methods give distributions over k
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...
PKDD
2004
Springer
13 years 11 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...