Sciweavers

3341 search results - page 466 / 669
» On Bounded Queries and Approximation
Sort
View
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
16 years 1 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
FOCS
2009
IEEE
16 years 1 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
ICC
2009
IEEE
16 years 1 months ago
Robust Cyclic Space-Frequency Filtering for BICM-OFDM with Outdated CSIT
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
Harry Z. B. Chen, Robert Schober, Wolfgang H. Gers...
INFOCOM
2009
IEEE
16 years 1 months ago
Downlink MIMO with Frequency-Domain Packet Scheduling for 3GPP LTE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
Suk-Bok Lee, Sayantan Choudhury, Ahmad Khoshnevis,...
INFOCOM
2009
IEEE
16 years 1 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa