4372 search results - page 366 / 875 » Algorithmic Theories of Everything |
191
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
173
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
171
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
171
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
210
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
Implicit feedback algorithms utilize interaction between searchers and search systems to learn more about users’ needs and interests than expressed in query statements alone. Th...