Sciweavers

7015 search results - page 964 / 1403
» Approximation algorithms for co-clustering
Sort
View
153
Voted
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
16 years 1 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 29 days ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
ISICA
2007
Springer
16 years 29 days ago
On the Performance of Metamodel Assisted MOEA/D
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
16 years 29 days ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
MIRAGE
2007
Springer
16 years 29 days ago
A Note on the Discrete Binary Mumford-Shah Model
Abstract. This paper is concerned itself with the analysis of the twophase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It c...
Jérôme Darbon