74 search results - page 7 / 15 » Combination Can Be Hard: Approximability of the Unique Cover... |
ESA
2009
Springer
14 years 1 days ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
STOC
2010
ACM
14 years 8 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
IJFCS
2006
13 years 7 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Broadband access for all will be a key functionality in future mobile radio networks. Depending on the length and the characteristic of the radio wave propagation the performan...