2487 search results - page 200 / 498 » Partitions of Graphs into Trees |
131
click to vote
AAAI
1996
15 years 5 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
165
Voted
MLMTA
2007
15 years 5 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
153
Voted
JMLR
2012
13 years 6 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
141
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
174
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...