290 search results - page 46 / 58 » Local Partitioning for Directed Graphs Using PageRank |
118
click to vote
NIPS
2004
15 years 1 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
102
click to vote
SIGADA
1999
Springer
15 years 3 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
111
click to vote
CGF
2008
14 years 11 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
114
click to vote
BDA
2007
15 years 1 months ago
2007
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
DSN
2005
IEEE
15 years 5 months ago
2005
IEEE
Continuous-time Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a space-ef...