4894 search results - page 320 / 979 » The Guarding Problem - Complexity and Approximation |
178
click to vote
TIP
2008
15 years 6 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
173
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
220
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
181
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
176
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...