1695 search results - page 143 / 339 » Linear, Polynomial or Exponential |
152
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
148
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider the task of acoustic system identification, where the input signal undergoes a memoryless nonlinear transformation before convolving with an unknown linear system. We...
162
click to vote
SAGT
2009
Springer
15 years 9 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
155
Voted
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
138
Voted
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...