Sciweavers

29 search results - page 1 / 6
» On clustering to minimize the sum of radii
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 9 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 10 months ago
On clustering to minimize the sum of radii
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
EOR
2010
99views more  EOR 2010»
13 years 9 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
CCCG
2007
13 years 10 months ago
A Disk-Covering Problem with Application in Optical Interferometry
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...
SDM
2004
SIAM
187views Data Mining» more  SDM 2004»
13 years 10 months ago
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...