1161 search results - page 71 / 233 » Approximation schemes for clustering problems |
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
MA
2010
Springer
14 years 8 months ago
2010
Springer
This paper deals with the quantization problem of a random variable X taking values in a separable and re exive Banach space, and with the related question of clustering independ...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
PAMI
2011
14 years 4 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
AAAI
2012
13 years 4 days ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...