1949 search results - page 101 / 390 » Random graphs on surfaces |
168
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
154
Voted
KDD
2007
ACM
16 years 4 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...
169
click to vote
CORR
2011
Springer
14 years 11 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...
142
click to vote
IV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
138
Voted
CGF
2004
15 years 4 months ago
2004
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...