1161 search results - page 34 / 233 » Approximation schemes for clustering problems |
170
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
70
Voted
IDA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
ICWS
2009
IEEE
15 years 6 months ago
2009
IEEE
The main memory management has been a critical issue to provide high performance in web cluster systems. To overcome the speed gap between processors and disks, many prefetch sche...