5595 search results - page 100 / 1119 » Approximation Algorithms for Clustering Problems |
143
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
176
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
136
click to vote
CIARP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Cluster validation to determine the right number of clusters is an important issue in clustering processes. In this work, a strategy to address the problem of cluster val...
127
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
146
click to vote
NIPS
2007
15 years 6 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...