290 search results - page 34 / 58 » Local Partitioning for Directed Graphs Using PageRank |
118
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
135
click to vote
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
125
click to vote
PACT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
182
Voted
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
112
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...