5595 search results - page 71 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
143
click to vote
UAI
2004
15 years 6 months ago
2004
In this paper, a similarity-driven cluster merging method is proposed for unsupervised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster valid...
123
click to vote
ORL
2006
15 years 4 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
194
click to vote
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
101
click to vote
ESANN
2000
15 years 6 months ago
2000
Iterative algorithm based on quantum tunneling is proposed by making use of mean- eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...