2681 search results - page 86 / 537 » Problem F |
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
GECCO
1999
Springer
14 years 2 months ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
CAIP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The support vector machine is basically to deal with a two-class classification problem. To get M-class classifiers for face recognition, it is common to construct a set ...
FOCM
2007
13 years 10 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...