187 search results - page 33 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
KDD
2008
ACM
15 years 9 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
143
click to vote
SIGAL
1990
15 years 1 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
OOPSLA
2010
Springer
14 years 7 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
PE
2011
Springer
14 years 4 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...