3913 search results - page 427 / 783 » complexity 2006 |
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and ...
188
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
159
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
188
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...