Sciweavers

1298 search results - page 85 / 260
» The online set cover problem
Sort
View
WWW
2008
ACM
16 years 7 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
AAAI
2012
13 years 8 months ago
Online Kernel Selection: Algorithms and Evaluations
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Y...
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Turning down the noise in the blogosphere
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
Khalid El-Arini, Gaurav Veda, Dafna Shahaf, Carlos...
NIPS
2001
15 years 7 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
TAMC
2007
Springer
16 years 16 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley