1816 search results - page 50 / 364 » A New Approach for Solving the Maximum Clique Problem |
GI
2007
Springer
15 years 6 months ago
2007
Springer
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
109
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
ESANN
2006
15 years 1 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
108
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. A common approach for separation of convolutive mixtures is...
103
click to vote
UAI
2004
15 years 1 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...