2503 search results - page 155 / 501 » A study of 3-arc graphs |
167
click to vote
CLUSTER
2005
IEEE
16 years 5 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
186
click to vote
ICITA
2005
IEEE
16 years 4 days ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
179
click to vote
IV
2010
IEEE
15 years 5 months ago
2010
IEEE
There have been two types of Web visualization techniques: visualization of Web sites themselves based on such as link structures or lexical contents, and visualization of browser...
168
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
190
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...