Sciweavers

58 search results - page 4 / 12
» Improved competitive ratio for the matroid secretary problem
Sort
View
FCT
2009
Springer
14 years 1 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
DIS
2009
Springer
14 years 3 months ago
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
Yasser El-Manzalawy, Vasant Honavar
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 11 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 10 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu