Sciweavers

478 search results - page 8 / 96
» Improving probability bounds by optimization over subsets
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 2 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
JSAC
2006
89views more  JSAC 2006»
13 years 7 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
VTC
2008
IEEE
218views Communications» more  VTC 2008»
14 years 1 months ago
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...
Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, G...
INFOCOM
2011
IEEE
12 years 11 months ago
Optimal Sybil-resilient node admission control
—Most existing large-scale networked systems on the Internet such as peer-to-peer systems are vulnerable to Sybil attacks where a single adversary can introduce many bogus identi...
Nguyen Tran, Jinyang Li, Lakshminarayanan Subraman...