Sciweavers

1600 search results - page 145 / 320
» Clustering for opportunistic communication
Sort
View
PDCN
2004
15 years 7 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
OSDI
1994
ACM
15 years 7 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...
GLOBECOM
2008
IEEE
15 years 6 months ago
Computing the Receive Spatial Correlation for a Multi-Cluster MIMO Channel Using Different Array Configurations
Spatial correlation among received signals has a significant impact on the performance of a multipleinput multiple-output (MIMO) system. In prior research, expressions were derived...
Ramya Bhagavatula, Robert W. Heath Jr.
IJSNET
2006
106views more  IJSNET 2006»
15 years 6 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
Philip Schniter