256 search results - page 25 / 52 » Sparse random graphs with clustering |
FPL
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
PAMI
2007
13 years 7 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
WEA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...