Sciweavers

843 search results - page 40 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 1 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
CVPR
2010
IEEE
14 years 3 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
IJON
2006
131views more  IJON 2006»
13 years 7 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 1 months ago
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
Arnaud Soulet, Bruno Crémilleux
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...