1949 search results - page 229 / 390 » Random graphs on surfaces |
178
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
145
click to vote
ICDM
2006
IEEE
16 years 3 days ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
160
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
178
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
148
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...