1389 search results - page 53 / 278 » Improved Approximation Algorithms for Label Cover Problems |
129
Voted
STACS
2010
Springer
15 years 14 days ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
100
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
124
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
133
Voted
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
119
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....