164 search results - page 7 / 33 » Developing Genetic Algorithms for Boolean Matrix Factorizati... |
106
click to vote
TOMS
2008
14 years 11 months ago
2008
We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a tr...
101
Voted
STOC
1998
ACM
15 years 3 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
88
Voted
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
— The second-order statistics of a time-domain signal are very often used in blind and semi-blind channel estimation. Considering that the received signal in MIMO-OFDM systems mi...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Regulatory networks are complex networks. This paper addresses the challenge of modelling these networks. The Boolean representation is chosen and supported as a representation...
115
Voted
PKC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...