4411 search results - page 355 / 883 » Communication Complexity and Its Applications |
163
click to vote
ISCIS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
191
click to vote
CASC
2006
Springer
15 years 10 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
151
Voted
IEICET
2006
15 years 6 months ago
2006
Abstract -- The application of Orthogonal SpaceTime Block Codes (O-STBC) as the encoding scheme in the presence of "non-quasi-static" fading was considered. A simple and ...
206
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
185
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...