13603 search results - page 23 / 2721 » On the computational complexity of bridgecard |
201
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
156
click to vote
WSC
2004
15 years 8 months ago
2004
This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...
178
click to vote
UC
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
186
click to vote
TC
2008
15 years 6 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
176
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...