522 search results - page 25 / 105 » Energy Models for Graph Clustering |
128
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
148
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
153
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
130
Voted
MOBICOM
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
153
click to vote
CASES
2006
ACM
15 years 8 months ago
2006
ACM
Customizing architectures for particular applications is a promising approach to yield highly energy-efficient designs for embedded systems. This work explores the benefits of arc...