38 search results - page 5 / 8 » Computing the Permanent of (Some) Complex Matrices |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
WCC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
COMPUTING
2006
14 years 10 months ago
2006
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...