23 search results - page 1 / 5 » A general framework for vertex orderings, with applications ... |
ICCAD
1994
IEEE
13 years 9 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...