Sciweavers

30 search results - page 6 / 6
» Sub-Sampled Newton Methods I: Globally Convergent Algorithms
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
13 years 11 months ago
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
M. A. Abido
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 9 months ago
Adaptive strategy selection in differential evolution
Differential evolution (DE) is a simple yet powerful evolutionary algorithm for global numerical optimization. Different strategies have been proposed for the offspring generation...
Wenyin Gong, Álvaro Fialho, Zhihua Cai
EMMCVPR
2007
Springer
13 years 11 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
13 years 11 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 8 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing