Sciweavers

6568 search results - page 2 / 1314
» Reducing the Complexity of Reductions
Sort
View
GLOBECOM
2007
IEEE
15 years 3 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 4 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
GLOBECOM
2006
IEEE
15 years 3 months ago
Reduced Complexity Vector Precoding for the Multiuser Downlink
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...
René Habendorf, Ines Riedel, Gerhard Fettwe...
CORR
2006
Springer
156views Education» more  CORR 2006»
14 years 9 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 1 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson