5595 search results - page 280 / 1119 » Approximation Algorithms for Clustering Problems |
184
click to vote
SYNASC
2005
IEEE
16 years 6 days ago
2005
IEEE
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...
211
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
184
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
161
click to vote
PR
2008
15 years 6 months ago
2008
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...