Sciweavers

35 search results - page 5 / 7
» Online Passive-Aggressive Algorithms on a Budget
Sort
View
WSDM
2012
ACM
214views Data Mining» more  WSDM 2012»
12 years 3 months ago
Selecting actions for resource-bounded information extraction using reinforcement learning
Given a database with missing or uncertain content, our goal is to correct and fill the database by extracting specific information from a large corpus such as the Web, and to d...
Pallika H. Kanani, Andrew K. McCallum
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 1 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
11 years 10 months ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 15 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
INFOCOM
2009
IEEE
14 years 2 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...