Sciweavers

2957 search results - page 340 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 1 months ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
INFOCOM
2008
IEEE
16 years 1 months ago
Information Concealing Games
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
Saswati Sarkar, Eitan Altman, Rachid El Azouzi, Ye...
IROS
2008
IEEE
191views Robotics» more  IROS 2008»
16 years 1 months ago
Local Gaussian process regression for real-time model-based robot control
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
Duy Nguyen-Tuong, Jan Peters
ICC
2007
IEEE
160views Communications» more  ICC 2007»
16 years 28 days ago
Differential Bell-Labs Layered Space Time Architectures
Abstract—Most research on differential MIMO is based on spacetime block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust by the aid ...
Lingyang Song, Alister G. Burr, Rodrigo C. de Lama...
INFOCOM
2007
IEEE
16 years 27 days ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri