2698 search results - page 164 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
160
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
185
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
186
click to vote
ACL
2010
15 years 4 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
159
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
181
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...