7015 search results - page 1058 / 1403 » Approximation algorithms for co-clustering |
142
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
194
click to vote
TVCG
1998
15 years 6 months ago
1998
—This paper describes three new results for volume rendering algorithms utilizing splatting. First, an antialiasing extension to the basic splatting algorithm is introduced that ...
161
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
162
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
203
click to vote
IJRR
2010
15 years 5 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...