12 search results - page 2 / 3 » Local Clustering of Large Graphs by Approximate Fiedler Vect... |
IM
2007
13 years 4 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
PPOPP
2010
ACM
14 years 1 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
BMCBI
2007
13 years 4 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
NIPS
2004
13 years 5 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
NIPS
2007
13 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...