Sciweavers

948 search results - page 27 / 190
» What can we achieve by arbitrary announcements
Sort
View
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
ATAL
2003
Springer
14 years 25 days ago
Deriving individual obligations from collective obligations
A collective obligation is an obligation directed to a group of agents so that the group, as a whole, is obliged to achieve a given task. The problem investigated here is the impac...
Laurence Cholvy, Christophe Garion
SPAA
2003
ACM
14 years 25 days ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
CCS
2011
ACM
12 years 7 months ago
Fashion crimes: trending-term exploitation on the web
Online service providers are engaged in constant conflict with miscreants who try to siphon a portion of legitimate traffic to make illicit profits. We study the abuse of “tr...
Tyler Moore, Nektarios Leontiadis, Nicolas Christi...
SIGCOMM
2010
ACM
13 years 7 months ago
Contrabass: concurrent transmissions without coordination
A PHY and MAC protocol for MIMO concurrent transmissions, called Contrabass, is presented. Concurrent transmissions, also referred to as multi-user MIMO, are simultaneous transmis...
Sungro Yoon