Sciweavers

17185 search results - page 3431 / 3437
» Computational and Quantitative Studies
Sort
View
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 9 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 9 months ago
Factoring past exposure in display advertising targeting
Online advertising is increasingly becoming more performance oriented, where the decision to show an advertisement to a user is made based on the user’s propensity to respond to...
Neha Gupta, Abhimanyu Das, Sandeep Pandey, Vijay K...
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
11 years 9 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 9 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
« Prev « First page 3431 / 3437 Last » Next »