Sciweavers

876 search results - page 2 / 176
» Complexity in geometric SINR
Sort
View
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
13 years 9 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
TWC
2008
123views more  TWC 2008»
13 years 4 months ago
Block diagonal geometric mean decomposition (BD-GMD) for MIMO broadcast channels
In recent years, the research on multiple-input multiple-output (MIMO) broadcast channels has attracted much interest, especially since the discovery of the broadcast channel capac...
Shaowei Lin, Winston W. L. Ho, Ying-Chang Liang
GLOBECOM
2007
IEEE
13 years 11 months ago
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
Ashutosh Deepak Gore, Abhay Karandikar, Srikanth J...
GRIDNETS
2008
13 years 6 months ago
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
Xiaohua Li
TSP
2008
100views more  TSP 2008»
13 years 4 months ago
Finite-Sample Performance Analysis of Widely Linear Multiuser Receivers for DS-CDMA Systems
Abstract--This paper tackles the theoretical performance analysis of widely-linear (WL) multiuser receivers for direct-sequence code-division multiple-access (DS-CDMA) systems, as ...
Angela Sara Cacciapuoti, Giacinto Gelli, Luigi Pau...