Sciweavers

29908 search results - page 50 / 5982
» On the complexity of communication complexity
Sort
View
VTC
2006
IEEE
104views Communications» more  VTC 2006»
14 years 4 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
IFIP
2004
Springer
14 years 3 months ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
WSC
2007
14 years 12 days ago
Simulation framework for complex manufacturing systems with automated material handling
In this paper, we suggest a framework that allows for the simulation-based performance assessment of complex manufacturing systems with Automated Material Handling Systems (AMHS)....
Rene Driessel, Lars Mönch
JPDC
2006
92views more  JPDC 2006»
13 years 10 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang
DCC
2006
IEEE
14 years 4 months ago
Quantization on the Complex Projective Space
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
Bishwarup Mondal, Satyaki Dutta, Robert W. Heath J...