7006 search results - page 173 / 1402 » Approximation Algorithms |
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...
137
click to vote
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
126
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
108
click to vote
TALG
2010
15 years 1 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
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...