Sciweavers

1952 search results - page 8 / 391
» Complete partitions of graphs
Sort
View
PPSC
1997
13 years 9 months ago
A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
George Karypis, Vipin Kumar
FOCS
2003
IEEE
14 years 1 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
AAAI
2007
13 years 10 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 3 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 7 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...