2061 search results - page 75 / 413 » The continuous knapsack set |
CCCG
2007
14 years 11 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
MICCAI
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we propose a weakly supervised learning algorithm for appearance models based on the minimum description length (MDL) principle. From a set of training images or volu...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
CASDMKM
2004
Springer
15 years 3 months ago
2004
Springer
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...