1221 search results - page 121 / 245 » Balanced graph partitioning |
JMLR
2012
12 years 17 days 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...
KDD
2005
ACM
14 years 10 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...
IPPS
2007
IEEE
14 years 4 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...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
EWSN
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Sensor network devices have limited battery resources primarily consumed by radio communication. Network nodes play different communication roles and consequently consume...