290 search results - page 30 / 58 » Local Partitioning for Directed Graphs Using PageRank |
NIPS
2000
15 years 3 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
133
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
113
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
257
click to vote
COCOA
2011
Springer
14 years 2 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
126
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...