Sciweavers

2463 search results - page 79 / 493
» Rankings of Directed Graphs
Sort
View
WWW
2005
ACM
14 years 9 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 2 months ago
Usage-Based PageRank for Web Personalization
Recommendation algorithms aim at proposing “next” pages to a user based on her current visit and the past users’ navigational patterns. In the vast majority of related algor...
Magdalini Eirinaki, Michalis Vazirgiannis
JPDC
2007
177views more  JPDC 2007»
13 years 9 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
UAI
2008
13 years 10 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
14 years 1 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers