352 search results - page 30 / 71 » Partitioning Graphs into Connected Parts |
214
click to vote
ICDM
2006
IEEE
16 years 5 days ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
164
Voted
FPGA
1998
ACM
15 years 10 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
173
click to vote
DAM
2010
15 years 6 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
191
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
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...
208
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...