3875 search results - page 493 / 775 » Approximation algorithms for the 0-extension problem |
181
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
200
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
203
click to vote
DATAMINE
2010
15 years 6 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
172
click to vote
COMPGEOM
2006
ACM
16 years 19 days ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
248
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...