2600 search results - page 13 / 520 » Clustering with or without the Approximation |
CATS
2006
13 years 9 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
SDM
2011
SIAM
12 years 10 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
MOC
2002
13 years 7 months ago
2002
Using the main ideas of Tanaka, the measure-solution {Pt}t of a 3-dimensional spatially homogeneous Boltzmann equation of Maxwellian molecules without cutoff is related to a Poisso...
SIROCCO
2008
13 years 9 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...