1952 search results - page 194 / 391 » Complete partitions of graphs |
186
click to vote
AAAI
2008
15 years 8 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...
157
click to vote
TCS
2008
15 years 6 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...
171
click to vote
MICCAI
2004
Springer
16 years 7 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...
197
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
191
click to vote
ICASSP
2007
IEEE
16 years 25 days ago
2007
IEEE
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...