Sciweavers

46 search results - page 7 / 10
» Maximizing Non-Monotone Submodular Functions
Sort
View
151
Voted
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 3 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
224
Voted
EMMCVPR
2011
Springer
14 years 2 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
102
Voted
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 12 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
143
Voted
JMLR
2008
159views more  JMLR 2008»
15 years 2 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
123
Voted
ICML
2010
IEEE
15 years 3 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