1480 search results - page 72 / 296 » Distributed algorithms for weighted problems in sparse graph... |
125
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
150
Voted
DAM
2002
15 years 2 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
132
Voted
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
126
Voted
EMO
2001
Springer
15 years 7 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
149
Voted
ALGORITHMICA
1998
15 years 2 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...