4894 search results - page 336 / 979 » The Guarding Problem - Complexity and Approximation |
198
click to vote
MMAS
2010
Springer
15 years 1 months ago
2010
Springer
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
162
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
156
click to vote
STACS
2007
Springer
16 years 25 days ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
184
click to vote
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
185
click to vote
GRAPP
2007
15 years 8 months ago
2007
We consider the problem of approximating the 3D scan of a real object through an affine combination of examples. Common approaches depend either on the explicit estimation of poi...