Sciweavers

517 search results - page 94 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
ICML
2010
IEEE
14 years 11 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
JCO
2006
234views more  JCO 2006»
14 years 9 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 9 days ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
WWW
2007
ACM
15 years 10 months ago
Learning information intent via observation
Workers in organizations frequently request help from assistants by sending request messages that express information intent: an intention to update data in an information system....
Anthony Tomasic, Isaac Simmons, John Zimmerman