1389 search results - page 108 / 278 » Improved Approximation Algorithms for Label Cover Problems |
207
click to vote
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
133
click to vote
ALGOSENSORS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
133
click to vote
STOC
2005
ACM
15 years 8 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
109
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
STOC
2002
ACM
16 years 3 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...