3068 search results - page 23 / 614 » Clustering with Multiple Graphs |
NIPS
2008
13 years 10 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
ICONIP
2008
13 years 10 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
IPPS
1999
IEEE
14 years 23 days ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...