780 search results - page 26 / 156 » Cost-Sharing Approximations for h |
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
CIKM
2004
Springer
14 years 22 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
MICCAI
1999
Springer
13 years 11 months ago
1999
Springer
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
IJCAI
2003
13 years 8 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...