394 search results - page 14 / 79 » Computing Minimal Polynomials of Matrices |
113
Voted
EJC
2008
15 years 15 days ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
114
Voted
TNN
2010
14 years 7 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
102
click to vote
ACMSE
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
130
Voted
CRYPTO
2012
Springer
13 years 2 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
110
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...