5595 search results - page 348 / 1119 » Approximation Algorithms for Clustering Problems |
205
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
205
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
246
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
170
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
192
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose a variational bayes approach to the problem of robust estimation of gaussian mixtures from noisy input data. The proposed algorithm explicitly takes into account the un...