2626 search results - page 123 / 526 » The complexity of stochastic sequences |
152
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
— This paper proposes a new QAM based codebook for beamforming in multiple-input multiple-output (MIMO) wireless systems with a limited-rate feedback channel. We show that such c...
155
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
153
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
140
click to vote
IJCAI
1993
15 years 7 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
137
click to vote
IJON
2007
15 years 6 months ago
2007
Hebbian cell assemblies have been proposed as a model for cortical processing able to bridge between physiology and psychology. Assembly-based theories focused mainly on represent...