5606 search results - page 637 / 1122 » Randomization Techniques for Graphs. |
233
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
191
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
200
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
167
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
199
click to vote
LREC
2008
15 years 8 months ago
2008
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...