17049 search results - page 3373 / 3410 » cans 2007 |
120
Voted
CC
2007
Springer
15 years 3 months ago
2007
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 ...
154
click to vote
COLING
2007
15 years 3 months ago
2007
eneral, the notion that computation in a serious sense, not just as some highly abstract grounding or, maybe, politically correct meta-reference, has something important to say to ...
145
Voted
ISM
2008
IEEE
15 years 3 months ago
2008
IEEE
It is important for managers and Information Technology professionals to understand data-driven decision support systems and how such systems can provide business intelligence and ...
133
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
127
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Diversity–multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high da...