Sciweavers

9572 search results - page 398 / 1915
» Cover Algorithms and Their Combination
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
On cooperative image denoising
In this paper we suggest how several competing image denoising algorithms, differing in design parameters, or even in design principles, can be combined together to yield a better...
Maciej Niedzwiecki, Szymon Gackowski
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
16 years 5 days ago
A Hybrid Genetic Approach for Circuit Bipartitioning
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
Jong-Pil Kim, Yong-Hyuk Kim, Byung Ro Moon
NIPS
2003
15 years 8 months ago
Approximate Expectation Maximization
We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate i...
Tom Heskes, Onno Zoeter, Wim Wiegerinck
ANOR
2006
69views more  ANOR 2006»
15 years 6 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
KBSE
2007
IEEE
16 years 1 months ago
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
Kobi Inkumsah, Tao Xie