page 59903 / 60054 » publications |
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
205
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
216
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
260
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
247
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
With the recent availability of commercial light field cameras, we can foresee a future in which light field signals will be as common place as images. Hence, there is an immine...