7006 search results - page 1055 / 1402 » Approximation Algorithms |
175
click to vote
TIP
1998
15 years 6 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
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...
196
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 ...
164
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...
210
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...