1998 search results - page 271 / 400 » Complexity of the Cover Polynomial |
VTC
2007
IEEE
15 years 7 months 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 ...
65
Voted
AAECC
2007
Springer
15 years 7 months 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...
92
Voted
DBPL
2007
Springer
15 years 7 months 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...
ECML
2007
Springer
15 years 7 months 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...
107
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...