7006 search results - page 192 / 1402 » Approximation Algorithms |
128
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
165
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
166
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
105
click to vote
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
149
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...