1243 search results - page 56 / 249 » Complexity reduction of C-Algorithm |
131
click to vote
SMA
2003
ACM
15 years 6 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
FSTTCS
1992
Springer
15 years 5 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
132
click to vote
DAC
2008
ACM
15 years 3 months ago
2008
ACM
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
CORR
1999
Springer
15 years 1 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
121
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...