1952 search results - page 135 / 391 » Complete partitions of graphs |
157
click to vote
JMLR
2012
13 years 7 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...
143
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...
179
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...
134
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
142
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...