1243 search results - page 110 / 249 » Complexity reduction of C-Algorithm |
121
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper considers linear precoding for time-varying multipleinput multiple-output (MIMO) channels. We show that linear minimum mean-squared error (LMMSE) equalization based on ...
125
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
118
click to vote
ICCD
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a new application field for the Goertzel algorithm. The test of mixed-signal circuits involves the generation and analysis of signals. A standard method for th...