274 search results - page 18 / 55 » corr 2004 |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
CORR
2004
Springer
13 years 9 months ago
2004
Springer
By making use of the notions and the notations from [12], we present the bounded delays, the absolute inertia and the relative inertia. 1 Bounded Delays
CORR
2004
Springer
13 years 9 months ago
2004
Springer
The notion of limit condition that we propose is a generalization of the delay condition [1], [2], including the models of the delay circuits, of the C elements of Muller and of t...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
: We will try to tackle both the theoretical and practical aspects of a very important problem in chess programming as stated in the title of this article
CORR
2004
Springer
13 years 9 months ago
2004
Springer
This paper explains why MMSE estimation arises in lattice-based strategies for approaching the capacity of linear Gaussian channels, and comments on its properties.