1379 search results - page 194 / 276 » The Complexity of the Annihilating Polynomial |
143
click to vote
ISPDC
2007
IEEE
16 years 20 days ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
158
click to vote
VTC
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
130
click to vote
AAECC
2007
Springer
16 years 17 days ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
144
click to vote
DBPL
2007
Springer
16 years 16 days ago
2007
Springer
BPQL is a novel query language for querying business process specifications, introduced recently in [5, 6]. It is based on an intuitive business processes as rewriting systems, an...
160
click to vote
ECML
2007
Springer
16 years 16 days ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...