1133 search results - page 56 / 227 » Basics of Graph Cuts |
MICCAI
2004
Springer
14 years 11 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...
ICASSP
2007
IEEE
14 years 4 months 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 ...
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
TASLP
2008
13 years 10 months ago
2008
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
SIAMCOMP
2011
13 years 26 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...