Sciweavers

10988 search results - page 164 / 2198
» Algorithmic Folding Complexity
Sort
View
147
Voted
CISS
2008
IEEE
15 years 10 months ago
A low complexity linear multiuser MIMO beamforming system with limited feedback
—In this paper, we propose a low complexity linear multiuser beamforming system for the multiple-input multipleoutput (MIMO) broadcast channel. We consider the specific case of ...
Chan-Byoung Chae, David Mazzarese, Nihar Jindal, R...
137
Voted
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 9 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
ICALP
2001
Springer
15 years 8 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
116
Voted
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 7 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
136
Voted
TCOM
2008
151views more  TCOM 2008»
15 years 3 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee