543 search results - page 72 / 109 » A Multiagent Algorithm for Graph Partitioning |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
APBC
2004
13 years 9 months ago
2004
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
ICAIL
2009
ACM
14 years 20 days ago
2009
ACM
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...