1379 search results - page 150 / 276 » The Complexity of the Annihilating Polynomial |
145
click to vote
FLAIRS
2006
15 years 7 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
184
click to vote
NETWORKING
2000
15 years 7 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
209
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
142
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...