7930 search results - page 484 / 1586 » Greedy in Approximation Algorithms |
192
click to vote
COMPGEOM
2004
ACM
16 years 11 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
197
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
241
click to vote
ESANN
2000
15 years 8 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
173
click to vote
TCS
2010
15 years 5 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
178
click to vote
COMPGEOM
2006
ACM
16 years 28 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...