Sciweavers

29 search results - page 6 / 6
» On clustering to minimize the sum of radii
Sort
View
JUCS
2002
131views more  JUCS 2002»
13 years 10 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
JPDC
2006
92views more  JPDC 2006»
13 years 10 months ago
Task assignment in heterogeneous computing systems
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...
Bora Uçar, Cevdet Aykanat, Kamer Kaya, Mura...
COMPGEOM
2006
ACM
14 years 4 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ICML
2006
IEEE
14 years 11 months ago
R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization
Principal component analysis (PCA) minimizes the sum of squared errors (L2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant L1-norm PCA (R1-PC...
Chris H. Q. Ding, Ding Zhou, Xiaofeng He, Hongyuan...