5595 search results - page 432 / 1119 » Approximation Algorithms for Clustering Problems |
154
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
161
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
162
click to vote
STACS
2007
Springer
16 years 29 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...
170
click to vote
INFOVIS
1998
IEEE
15 years 11 months ago
1998
IEEE
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
168
click to vote
CIKM
2004
Springer
16 years 7 days ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...