Sciweavers

79 search results - page 9 / 16
» An Online Algorithm for Maximizing Submodular Functions
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
MOBIHOC
2010
ACM
13 years 5 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 8 months ago
Turning down the noise in the blogosphere
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
Khalid El-Arini, Gaurav Veda, Dafna Shahaf, Carlos...
FOCS
2006
IEEE
14 years 1 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor