Sciweavers

4616 search results - page 192 / 924
» The Communication Complexity of Correlation
Sort
View
DC
2010
15 years 1 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
ASSETS
2004
ACM
16 years 1 days ago
Accessibility of Internet websites through time
Using Internet Archive’s Wayback Machine, a random sample of websites from 1997-2002 were retrospectively analyzed for effects that technology has on accessibility for persons w...
Stephanie Hackett, Bambang Parmanto, Xiaoming Zeng
GLOBECOM
2008
IEEE
16 years 1 months ago
Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
Luay Azzam, Ender Ayanoglu
VTC
2007
IEEE
139views Communications» more  VTC 2007»
16 years 27 days ago
A Low Complexity Frequency Domain Iterative Decision-Directed Channel Estimation Technique for Single-Carrier Systems
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...
GLOBECOM
2006
IEEE
16 years 20 days ago
On Decoding, Mutual Information, and Antenna Selection Diversity for Quasi-Orthogonal STBC with Minimum Decoding Complexity
Abstract— ABBA codes are an important class of quasiorthogonal space-time block codes proposed by Tirkkonen et al.. Recently, they have become more attractive for practical appli...
Dung Ngoc Dao, Chintha Tellambura