496 search results - page 61 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
WWW
2008
ACM
14 years 8 months ago
2008
ACM
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...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
PVLDB
2010
13 years 6 months ago
2010
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...