455 search results - page 82 / 91 » Approximation Algorithms for Partial Covering Problems |
STOC
2009
ACM
16 years 7 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper 1 addresses the problem of efficient visual 2D template tracking in image sequences. We adopt a discriminative approach in which the observations at each frame yield di...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
108
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
108
Voted
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...