Sciweavers

7 search results - page 1 / 2
» Submodular Secretary Problem and Extensions
Sort
View
APPROX
2010
Springer
112views Algorithms» more  APPROX 2010»
13 years 6 months ago
Submodular Secretary Problem and Extensions
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
ICRA
2010
IEEE
117views Robotics» more  ICRA 2010»
13 years 3 months ago
Online navigation summaries
— Our objective is to find a small set of images that summarize a robot’s visual experience along a path. We present a novel on-line algorithm for this task. This algorithm is...
Yogesh Girdhar, Gregory Dudek
JMLR
2008
159views more  JMLR 2008»
13 years 4 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ICML
2010
IEEE
13 years 5 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
AAAI
2007
13 years 7 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...