333 search results - page 7 / 67 » A Functional Approach to External Graph Algorithms |
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
127
click to vote
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
118
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
104
click to vote
ALMOB
2006
14 years 9 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...