5595 search results - page 288 / 1119 » Approximation Algorithms for Clustering Problems |
152
click to vote
AAAI
2006
15 years 8 months ago
2006
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
137
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
182
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
193
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...