290 search results - page 14 / 58 » Local Partitioning for Directed Graphs Using PageRank |
134
Voted
COMBINATORICA
2011
13 years 11 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
133
Voted
SC
1993
ACM
15 years 3 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
TSMC
1998
14 years 11 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
98
Voted
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
We use a Hierarchical Partition of Unity Finite Element Method (H-PUFEM) to represent and analyse the non-rigid deformation fields involved in multidimensional image registration...
174
click to vote
ISCA
2002
IEEE
14 years 11 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...