1221 search results - page 164 / 245 » Balanced graph partitioning |
115
click to vote
JCT
2007
15 years 2 months ago
2007
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
148
click to vote
RSA
2010
15 years 1 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
135
Voted
AAAI
2008
15 years 5 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
115
click to vote
TCS
2008
15 years 2 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
117
click to vote
MICCAI
2004
Springer
16 years 3 months ago
2004
Springer
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to cre...