4934 search results - page 442 / 987 » complexity 2008 |
203
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Selection cooperation is proposed for rateless coded relaying by developing a novel low-complexity protocol that exploits all source-destination, source-relay, and relay-destinatio...
237
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
195
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
182
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the e...
185
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...