993 search results - page 131 / 199 » A Fast Optimization Method for Level Set Segmentation |
152
click to vote
PAMI
2007
15 years 2 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
109
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
One problem in concatenative speech synthesis is how to incorporate prosodic factors in the unit selection. Imposing a predicted prosodic target is error-prone and does not benefi...
148
Voted
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
126
Voted
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
119
Voted
TCBB
2008
15 years 2 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...