2778 search results - page 2 / 556 » Limit complexities revisited |
CPC
2004
13 years 5 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
PC
2002
13 years 5 months ago
2002
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
MICRO
2007
IEEE
13 years 11 months ago
2007
IEEE
Single-threaded programming is already considered a complicated task. The move to multi-threaded programming only increases the complexity and cost involved in software developmen...
ICSE
2007
IEEE-ACM
14 years 5 months ago
2007
IEEE-ACM
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...